Delayed-Input Cryptographic Protocols
暂无分享,去创建一个
[1] Ivan Visconti,et al. Online/Offline OR Composition of Sigma Protocols , 2016, IACR Cryptol. ePrint Arch..
[2] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[3] Yunlei Zhao,et al. Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model , 2007, EUROCRYPT.
[4] Rafail Ostrovsky,et al. Simultaneous Resettability from Collision Resistance , 2012, Electron. Colloquium Comput. Complex..
[5] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Carmit Hazay,et al. On the Power of Secure Two-Party Computation , 2016, Journal of Cryptology.
[7] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[8] Adi Shamir,et al. Publicly Verifiable Non-Interactive Zero-Knowledge Proofs , 1990, CRYPTO.
[9] Giovanni Di Crescenzo,et al. Improved Setup Assumptions for 3-Round Resettable Zero Knowledge , 2004, ASIACRYPT.
[10] Rafail Ostrovsky,et al. 4-Round Resettably-Sound Zero Knowledge , 2014, TCC.
[11] Rafail Ostrovsky,et al. Concurrent Non-Malleable Commitments (and More) in 3 Rounds , 2016, CRYPTO.
[12] Ivan Visconti,et al. Improved OR Composition of Sigma-Protocols , 2016, IACR Cryptol. ePrint Arch..
[13] Daniele Venturi,et al. Fiat-Shamir for Highly Sound Protocols Is Instantiable , 2016, SCN.
[14] Rafail Ostrovsky,et al. On Round-Efficient Non-Malleable Protocols , 2016, IACR Cryptol. ePrint Arch..
[15] Hoeteck Wee,et al. Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[16] Silas Richelson,et al. An Algebraic Approach to Non-malleability , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[17] Giovanni Di Crescenzo,et al. Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model , 2004, CRYPTO.