为解决现有可验证外包数据库方案存在的查询类型较单一、更新和验证代价较高、数据膨胀率较大、效率较低难以应用于实际等问题,提出了一个基于双线性映射的支持全操作的公共可验证外包数据库(publicly verifiable database model with f...为解决现有可验证外包数据库方案存在的查询类型较单一、更新和验证代价较高、数据膨胀率较大、效率较低难以应用于实际等问题,提出了一个基于双线性映射的支持全操作的公共可验证外包数据库(publicly verifiable database model with full operations based on bilinear map, BMPVDB)模型.给出了该模型的架构及交互流程,并对该模型进行了形式化定义,针对该模型的安全需求给出了该模型的安全性定义.利用双线性映射构造了一个高效且支持全操作的公共可验证外包数据库方案,并对该方案中各算法进行了详细描述,证明了该方案的安全性,其安全性可归约为q-BSDH(bilinear q-strong Diffie-Hellman)和VBDHE(variant of bilinear Diffie-Hellman exponent)难题.最后将该方案与现有方案进行了对比,理论与实验分析表明:该方案功能更全面(各类集合操作、函数查询、嵌套查询)、更新与验证代价更低为常数级、数据膨胀率更低、效率更高可应用于实际.此外,该方案的验证与更新无需私钥参与,拥有公钥和摘要的用户均可进行验证与更新,实现了公共可验证和公共可更新.展开更多
A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS pl...A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryp- tographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.展开更多
∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the f...∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.展开更多
文摘为解决现有可验证外包数据库方案存在的查询类型较单一、更新和验证代价较高、数据膨胀率较大、效率较低难以应用于实际等问题,提出了一个基于双线性映射的支持全操作的公共可验证外包数据库(publicly verifiable database model with full operations based on bilinear map, BMPVDB)模型.给出了该模型的架构及交互流程,并对该模型进行了形式化定义,针对该模型的安全需求给出了该模型的安全性定义.利用双线性映射构造了一个高效且支持全操作的公共可验证外包数据库方案,并对该方案中各算法进行了详细描述,证明了该方案的安全性,其安全性可归约为q-BSDH(bilinear q-strong Diffie-Hellman)和VBDHE(variant of bilinear Diffie-Hellman exponent)难题.最后将该方案与现有方案进行了对比,理论与实验分析表明:该方案功能更全面(各类集合操作、函数查询、嵌套查询)、更新与验证代价更低为常数级、数据膨胀率更低、效率更高可应用于实际.此外,该方案的验证与更新无需私钥参与,拥有公钥和摘要的用户均可进行验证与更新,实现了公共可验证和公共可更新.
文摘A publicly verifiable secret sharing （PVSS） scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryp- tographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.
基金supported by the Foundation of tihe National Natural Science of China under Grant Nos 90604034 (Key Project), 10726012, 10871222, 10531040,and 10471156
文摘∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.
