Adaptive Concurrent Non-Malleability with Bare Public-Keys
作者： Andrew C. Yao , Moti Yung , Yunlei Zhao
DOI:
关键词:
摘要: Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently in environments such as the Internet. In this work, we formulate CNM bare public-key (BPK) model, and show that round-efficient concurrent non-malleable cryptography with full adaptive input selection can be established, general, public-keys (where, particular, no trusted assumption made). Along way, clarify various subtleties of model.
arxiv.org参考文章(58)
Yunlei Zhao, Jesper Buus Nielsen, Robert H Deng, Dengguo Feng, None, Generic yet Practical ZK Arguments from any Public-Coin HVZK Electronic Colloquium on Computational Complexity. ,(2005)
Manuel Blum, Coin Flipping by Telephone. international cryptology conference. pp. 11- 15 ,(1981)
Rafail Ostrovsky, Ivan Visconti, Giuseppe Persiano, Concurrent Non-Malleable Witness Indistinguishability and its Applications Electronic Colloquium on Computational Complexity. ,vol. 13, ,(2006)
Yehuda Lindell, Lower Bounds for Concurrent Self Composition theory of cryptography conference. pp. 203- 222 ,(2004) , 10.1007/978-3-540-24638-1_12
Mihir Bellare, Oded Goldreich, On Defining Proofs of Knowledge international cryptology conference. pp. 390- 420 ,(1992) , 10.1007/3-540-48071-4_28
R. Canetti, Universally composable security: a new paradigm for cryptographic protocols international conference on cluster computing. pp. 136- 145 ,(2001) , 10.1109/SFCS.2001.959888
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
Giovanni Di Crescenzo, Rafail Ostrovsky, On Concurrent Zero-Knowledge with Pre-processing international cryptology conference. pp. 485- 502 ,(1999) , 10.1007/3-540-48405-1_31
Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith, Efficient and Non-interactive Non-malleable Commitment Lecture Notes in Computer Science. pp. 40- 59 ,(2001) , 10.1007/3-540-44987-6_4
Shai Halevi, Silvio Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing international cryptology conference. pp. 201- 215 ,(1996) , 10.1007/3-540-68697-5_16