Generalizing Efficient Multiparty Computation
暂无分享,去创建一个
Ryo Nishimaki | Alain Tapp | Bernardo Machado David | Samuel Ranellucci | B. David | A. Tapp | Samuel Ranellucci | R. Nishimaki
[1] Jonathan Katz,et al. Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS , 2013, Public Key Cryptography.
[2] Jeroen van de Graaf,et al. Committed Oblivious Transfer and Private Multi-Party Computation , 1995, CRYPTO.
[3] Jan Camenisch,et al. Optimistic Fair Secure Computation , 2000, CRYPTO.
[4] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[5] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[6] Markulf Kohlweiss,et al. P-signatures and Noninteractive Anonymous Credentials , 2008, TCC.
[7] Jens Groth,et al. Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups , 2011, CRYPTO.
[8] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[9] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[10] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[11] Georg Fuchsbauer,et al. Structure-Preserving Signatures and Commitments to Group Elements , 2010, Journal of Cryptology.
[12] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[13] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[14] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[15] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[16] Yehuda Lindell,et al. Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer , 2010, IACR Cryptol. ePrint Arch..
[17] Vincent Naessens,et al. Structure Preserving CCA Secure Encryption and Applications , 2011, ASIACRYPT.
[18] Berry Schoenmakers,et al. Efficient Committed Oblivious Transfer of Bit Strings , 2007, ISC.
[19] K. Srinathan,et al. Alternative Protocols for Generalized Oblivious Transfer , 2008, ICDCN.
[20] Amit Sahai,et al. Efficient Noninteractive Proof Systems for Bilinear Groups , 2008, SIAM J. Comput..
[21] Yehuda Lindell,et al. The IPS Compiler: Optimizations, Variants and Concrete Efficiency , 2011, CRYPTO.
[22] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[23] Bogdan Warinschi,et al. Groth-Sahai proofs revisited , 2010, IACR Cryptol. ePrint Arch..
[24] Matthew Green,et al. Universally Composable Adaptive Oblivious Transfer , 2008, IACR Cryptol. ePrint Arch..
[25] Yuval Ishai,et al. Private simultaneous messages protocols with applications , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[26] Yehuda Lindell. Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries , 2015, Journal of Cryptology.
[27] Vitaly Shmatikov,et al. Efficient Two-Party Secure Computation on Committed Inputs , 2007, EUROCRYPT.
[28] Yevgeniy Dodis,et al. Cryptography against Continuous Memory Attacks , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[30] Tamir Tassa,et al. Generalized oblivious transfer by secret sharing , 2011, Des. Codes Cryptogr..