Based on RSA and Factoring
暂无分享,去创建一个
Qin Li | Chunhui Wu | Dongyang Long | Qin Li | Dongyang Long | Chunhui Wu
[1] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[2] Yi Mu,et al. Efficient generic on-line/off-line (threshold) signatures without key exposure , 2008, Inf. Sci..
[3] Xiaofeng Chen,et al. Efficient ID-based non-malleable trapdoor commitment , 2012, Comput. Electr. Eng..
[4] Giuseppe Ateniese,et al. On the Key Exposure Problem in Chameleon Hashes , 2004, SCN.
[5] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[6] Masayuki Abe,et al. Receipt-Free Sealed-Bid Auction , 2002, ISC.
[7] Ke Yang,et al. On Simulation-Sound Trapdoor Commitments , 2004, EUROCRYPT.
[8] Tatsuaki Okamoto,et al. Receipt-Free Electronic Voting Schemes for Large Scale Elections , 1997, Security Protocols Workshop.
[9] Ryo Nishimaki,et al. Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions , 2012, Journal of Cryptology.
[10] Kwangjo Kim,et al. Discrete logarithm based chameleon hashing and signatures without key exposure , 2011, Comput. Electr. Eng..
[11] Marc Fischlin,et al. Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security , 2011, ASIACRYPT.
[12] Jens Groth,et al. Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments , 2011, ASIACRYPT.
[13] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[14] Fangguo Zhang,et al. Comments and Improvements on Key-Exposure Free Chameleon Hashing Based on Factoring , 2010, Inscrypt.
[15] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[16] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[17] Marc Fischlin,et al. Efficient Non-malleable Commitment Schemes , 2009, J. Cryptol..
[18] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.