Digital Signatures with Minimal Overhead.
作者： Eike Kiltz , Mario Szegedy , Krzysztof Pietrzak
DOI:
关键词:
摘要:
参考文章(12)
Saqib A. Kakvi, Eike Kiltz, Optimal Security Proofs for Full Domain Hash, Revisited Advances in Cryptology – EUROCRYPT 2012. pp. 537- 553 ,(2012) , 10.1007/978-3-642-29011-4_32
Dan Boneh, Ben Lynn, Hovav Shacham, Short Signatures from the Weil Pairing international conference on the theory and application of cryptology and information security. pp. 514- 532 ,(2001) , 10.1007/3-540-45682-1_30
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron, Testing Triangle-Freeness in General Graphs SIAM Journal on Discrete Mathematics. ,vol. 22, pp. 786- 819 ,(2008) , 10.1137/07067917X
ASSAF NAOR, JACQUES VERSTRAËTE, A Note on Bipartite Graphs Without 2k-Cycles Combinatorics, Probability & Computing. ,vol. 14, pp. 845- 849 ,(2005) , 10.1017/S0963548305007029
Mihir Bellare, Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols computer and communications security. pp. 62- 73 ,(1993) , 10.1145/168588.168596
Jonathan Katz, Nan Wang, Efficiency improvements for signature schemes with tight security reductions computer and communications security. pp. 155- 164 ,(2003) , 10.1145/948109.948132
Pascal Paillier, Public-key cryptosystems based on composite degree residuosity classes theory and application of cryptographic techniques. pp. 223- 238 ,(1999) , 10.1007/3-540-48910-X_16
Shafi Goldwasser, Silvio Micali, Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks SIAM Journal on Computing. ,vol. 17, pp. 281- 308 ,(1988) , 10.1137/0217017
Chris Peikert, Brent Waters, Lossy trapdoor functions and their applications Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08. pp. 187- 196 ,(2008) , 10.1145/1374376.1374406
Jean-Sébastien Coron, Optimal Security Proofs for PSS and Other Signature Schemes international cryptology conference. pp. 272- 287 ,(2002) , 10.1007/3-540-46035-7_18