Compact VSS and Efficient Homomorphic UC Commitments
暂无分享,去创建一个
Ivan Damgård | Bernardo Machado David | Jesper Buus Nielsen | Irene Giacomelli | I. Damgård | B. David | J. Nielsen | Irene Giacomelli
[1] Rafail Ostrovsky,et al. Zero-Knowledge Proofs from Secure Multiparty Computation , 2009, SIAM J. Comput..
[2] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[3] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[4] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[5] Ivan Damgård,et al. Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing , 2013, TCC.
[6] David Pointcheval,et al. Analysis and Improvement of Lindell's UC-Secure Commitment Schemes , 2013, IACR Cryptol. ePrint Arch..
[7] Gilles Brassard,et al. Information theoretic reductions among disclosure problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[8] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[9] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[10] Severin Winkler,et al. On the Efficiency of Bit Commitment Reductions , 2011, ASIACRYPT.
[11] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[12] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[13] Claudio Orlandi,et al. MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions , 2013, EUROCRYPT.
[14] Ivan Damgård,et al. Non-interactive and reusable non-malleable commitment schemes , 2003, STOC '03.
[15] Ivan Damgård,et al. On the Necessary and Sufficient Assumptions for UC Computation , 2010, TCC.
[16] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[17] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[18] Eyal Kushilevitz,et al. Computing Functions of a Shared Secret , 2000, SIAM J. Discret. Math..
[19] Martin Hirt,et al. Efficient Multi-party Computation with Dispute Control , 2006, TCC.
[20] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[21] Rafail Ostrovsky,et al. Cryptography with constant computational overhead , 2008, STOC.
[22] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[23] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[24] Yuval Ishai,et al. On the Complexity of UC Commitments , 2014, EUROCRYPT.
[25] Yehuda Lindell,et al. Highly-Efficient Universally-Composable Commitments based on the DDH Assumption , 2011, IACR Cryptol. ePrint Arch..
[26] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[27] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[28] Yuval Ishai,et al. Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications , 2014, ITCS.
[29] Ivan Damgård,et al. On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations , 2012, ICITS.
[30] Salil P. Vadhan,et al. Characterizing pseudoentropy and simplifying pseudorandom generator constructions , 2012, STOC '12.
[31] Moni Naor,et al. Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.
[32] Benny Applebaum,et al. Pseudorandom generators with long stretch and low locality from random local one-way functions , 2012, STOC '12.