Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
作者： Georg Fuchsbauer , Christian Hanser , Chethan Kamath , Daniel Slamanig
DOI: 10.1007/978-3-319-44618-9_21
关键词: Standard model (cryptography) 、 Blind signature 、 Blindness 、 Random oracle 、 Scheme (programming language) 、 Mathematics 、 Simple (abstract algebra) 、 Algorithm 、 Bilinear interpolation 、 Inversion (discrete mathematics)
摘要: At Crypto 2015 Fuchsbauer, Hanser and Slamanig FHS presented the first standard-model construction of efficient round-optimal blind signatures that does not require complexity leveraging. It is conceptually simple builds on primitive structure-preserving equivalence classes SPS-EQ. prove unforgeability their scheme assuming EUF-CMA security SPS-EQ hardness a version DH inversion problem. Blindness under adversarially chosen keys proven an interactive variant DDH assumption. We propose whose blindness can be non-interactive assumption, namely bilinear assumption. We moreover its only underlying but no additional assumptions as needed for scheme.
springer.com
elsevier.com
sci-hub.se 参考文章(45)
Jae Hong Seo, Jung Hee Cheon, Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures theory of cryptography conference. pp. 133- 150 ,(2012) , 10.1007/978-3-642-28914-9_8
Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo, Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions Advances in Cryptology – ASIACRYPT 2012. pp. 4- 24 ,(2012) , 10.1007/978-3-642-34961-4_3
Sanjam Garg, Divya Gupta, Efficient Round Optimal Blind Signatures theory and application of cryptographic techniques. pp. 477- 495 ,(2014) , 10.1007/978-3-642-55220-5_27
Christian Hanser, Daniel Slamanig, Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials Lecture Notes in Computer Science. pp. 491- 511 ,(2014) , 10.1007/978-3-662-45611-8_26
Georg Fuchsbauer, Christian Hanser, Daniel Slamanig, Practical Round-Optimal Blind Signatures in the Standard Model international cryptology conference. ,vol. 2015, pp. 233- 253 ,(2015) , 10.1007/978-3-662-48000-7_12
Michel Abdalla, Chanathip Namprempre, Gregory Neven, On the (im)possibility of blind message authentication codes the cryptographers track at the rsa conference. pp. 262- 279 ,(2006) , 10.1007/11605805_17
Edward Knapp, Dennis Hofheinz, Tibor Jager, Waters signatures with optimal security reduction public key cryptography. pp. 66- 83 ,(2012) , 10.1007/978-3-642-30057-8_5
Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo, Structure-preserving signatures and commitments to group elements international cryptology conference. pp. 209- 236 ,(2010) , 10.1007/978-3-642-14623-7_12
Antoine Joux, A One Round Protocol for Tripartite Diffie-Hellman algorithmic number theory symposium. ,vol. 1838, pp. 385- 394 ,(2000) , 10.1007/10722028_23
Marc Fischlin, Round-Optimal Composable Blind Signatures in the Common Reference String Model Lecture Notes in Computer Science. pp. 60- 77 ,(2006) , 10.1007/11818175_4