Adaptive Proofs of Knowledge in the Random Oracle Model

作者: David Bernhard , Marc Fischlin , Bogdan Warinschi

DOI: 10.1007/978-3-662-46447-2_28

关键词:

摘要: We formalise the notion of adaptive proofs knowledge in random oracle model, where extractor has to recover witnesses for multiple, possibly adaptively chosen statements and proofs. also discuss extensions simulation soundness, as typically required “encrypt-then-prove” construction strongly secure encryption from IND-CPA schemes. Utilizing our model we show three results: (1) Simulation-sound exist. (2) The with a simulation-sound proof yields CCA security. This appears be “folklore” result but which never been proven model. As corollary, obtain new class CCA-secure schemes. (3) We that Fiat-Shamir transformed Schnorr protocol is not implications this limitation.

参考文章(55)
Uriel Feige, Dror Lapidot, Adi Shamir, Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) foundations of computer science. pp. 308- 317 ,(1990)
Ben Adida, Helios: web-based open-audit voting usenix security symposium. pp. 335- 348 ,(2008)
Sebastian Faust, Markulf Kohlweiss, Giorgia Azzurra Marson, Daniele Venturi, On the Non-malleability of the Fiat-Shamir Transform Lecture Notes in Computer Science. pp. 60- 79 ,(2012) , 10.1007/978-3-642-34931-7_5
Victor Shoup, Rosario Gennaro, Securing Threshold Cryptosystems against Chosen Ciphertext Attack Journal of Cryptology. ,vol. 15, pp. 75- 96 ,(2002) , 10.1007/S00145-001-0020-9
Mihir Bellare, Oded Goldreich, On Defining Proofs of Knowledge international cryptology conference. pp. 390- 420 ,(1992) , 10.1007/3-540-48071-4_28
Hoeteck Wee, Zero Knowledge in the Random Oracle Model, Revisited international conference on the theory and application of cryptology and information security. pp. 417- 434 ,(2009) , 10.1007/978-3-642-10366-7_25
Yuliang Zheng, Jennifer Seberry, Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks international cryptology conference. pp. 292- 304 ,(1992) , 10.1007/3-540-48071-4_20
Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs, Efficient public-key cryptography in the presence of key leakage international conference on the theory and application of cryptology and information security. pp. 613- 631 ,(2010) , 10.1007/978-3-642-17373-8_35
U. Feige, A. Shamir, Zero knowledge proofs of knowledge in two rounds international cryptology conference. pp. 526- 544 ,(1989) , 10.1007/0-387-34805-0_46
Marc Fischlin, Communication-efficient non-interactive proofs of knowledge with online extractors international cryptology conference. pp. 152- 168 ,(2005) , 10.1007/11535218_10