Rate-1, Linear Time and Additively Homomorphic UC Commitments
暂无分享,去创建一个
Ignacio Cascudo | Ivan Damgård | Nico Döttling | Bernardo Machado David | Jesper Buus Nielsen | I. Damgård | B. David | J. Nielsen | Nico Döttling | Ignacio Cascudo
[1] Yuval Ishai,et al. On the Complexity of UC Commitments , 2014, EUROCRYPT.
[2] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[3] Salil P. Vadhan,et al. Characterizing pseudoentropy and simplifying pseudorandom generator constructions , 2012, STOC '12.
[4] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[5] Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA , 2003, STOC.
[6] Venkatesan Guruswami,et al. Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.
[7] Ignacio Cascudo,et al. Additively Homomorphic UC Commitments with Optimal Amortized Overhead , 2015, Public Key Cryptography.
[8] Rafail Ostrovsky,et al. Cryptography with constant computational overhead , 2008, STOC.
[9] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[10] Yuval Ishai,et al. Secure Arithmetic Computation with No Honest Majority , 2008, IACR Cryptol. ePrint Arch..
[11] Yehuda Lindell,et al. Highly-Efficient Universally-Composable Commitments based on the DDH Assumption , 2011, IACR Cryptol. ePrint Arch..
[12] Arash Afshar,et al. How to Efficiently Evaluate RAM Programs with Malicious Security , 2014, EUROCRYPT.
[13] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[14] Ivan Damgård,et al. On the Necessary and Sufficient Assumptions for UC Computation , 2010, TCC.
[15] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[16] Yuval Ishai,et al. Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications , 2014, ITCS.
[17] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[18] Venkatesan Guruswami,et al. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.
[19] David Pointcheval,et al. Analysis and Improvement of Lindell's UC-Secure Commitment Schemes , 2013, IACR Cryptol. ePrint Arch..
[20] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[21] Ivan Damgård,et al. Compact VSS and Efficient Homomorphic UC Commitments , 2014, IACR Cryptol. ePrint Arch..
[22] Jesper Buus Nielsen,et al. On the Complexity of Additively Homomorphic UC Commitments , 2016, TCC.
[23] Ivan Damgård,et al. Non-interactive and reusable non-malleable commitment schemes , 2003, STOC '03.
[24] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[25] Venkatesan Guruswami,et al. Linear time encodable and list decodable codes , 2003, STOC '03.
[26] Luís T. A. N. Brandão,et al. Very-Efficient Simulatable Flipping of Many Coins into a Well - (and a New Universally-Composable Commitment Scheme) , 2016, Public Key Cryptography.
[27] Claudio Orlandi,et al. MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions , 2013, EUROCRYPT.