Covert Security with Public Verifiability: Faster, Leaner, and Simpler
暂无分享,去创建一个
Jonathan Katz | Cheng Hong | Vladimir Kolesnikov | Xiao Wang | Wen-jie Lu | Jonathan Katz | X. Wang | V. Kolesnikov | Cheng Hong | Wen-jie Lu
[1] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[2] Yehuda Lindell,et al. More efficient oblivious transfer and extensions for faster secure computation , 2013, CCS.
[3] Marcel Keller,et al. Actively Secure OT Extension with Optimal Overhead , 2015, CRYPTO.
[4] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[5] Yehuda Lindell,et al. An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries , 2007, Journal of Cryptology.
[6] David Evans,et al. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates , 2015, EUROCRYPT.
[7] Mihir Bellare,et al. Efficient Garbling from a Fixed-Key Blockcipher , 2013, 2013 IEEE Symposium on Security and Privacy.
[8] Yehuda Lindell. Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries , 2013, CRYPTO.
[9] Claudio Orlandi,et al. The Simplest Protocol for Oblivious Transfer , 2015, IACR Cryptol. ePrint Arch..
[10] Yehuda Lindell,et al. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, TCC.
[11] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[12] Adam D. Smith,et al. Efficient Two Party and Multi Party Computation Against Covert Adversaries , 2008, EUROCRYPT.
[13] Gilad Asharov,et al. Calling out Cheaters: Covert Security With Public Verifiability , 2012, IACR Cryptol. ePrint Arch..
[14] Jonathan Katz,et al. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation , 2017, CCS.
[15] Jonathan Katz,et al. Optimizing Authenticated Garbling for Faster Secure Two-Party Computation , 2018, IACR Cryptol. ePrint Arch..
[16] Yehuda Lindell. A Note on Constant-Round Zero-Knowledge Proofs of Knowledge , 2012, Journal of Cryptology.
[17] E. Kushilevitz. Foundations of Cryptography Foundations of Cryptography , 2014 .
[18] Alex J. Malozemoff,et al. Public Verifiability in the Covert Model (Almost) for Free , 2015, ASIACRYPT.
[19] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[20] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[21] Vladimir Kolesnikov,et al. Hashing Garbled Circuits for Free , 2017, EUROCRYPT.
[22] Ivan Damgård,et al. From Passive to Covert Security at Low Cost , 2010, TCC.