The Bottleneck Complexity of Secure Multiparty Computation
暂无分享,去创建一个
Manoj Prabhakaran | Abhishek Jain | Elette Boyle | Ching-Hua Yu | Abhishek Jain | M. Prabhakaran | Ching-Hua Yu | Elette Boyle
[1] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[2] Amit Sahai,et al. On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption , 2012, INDOCRYPT.
[3] Jens Groth,et al. Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs , 2017, IACR Cryptol. ePrint Arch..
[4] Nir Bitansky,et al. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again , 2012, ITCS '12.
[5] Zvika Brakerski,et al. Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts , 2016, CRYPTO.
[6] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[7] Yehuda Lindell,et al. Black-Box Constructions of Protocols for Secure Computation , 2011, IACR Cryptol. ePrint Arch..
[8] Chris Peikert,et al. Multi-key FHE from LWE, Revisited , 2016, TCC.
[9] Ivan Damgård,et al. On the Communication Required for Unconditionally Secure Multiplication , 2016, CRYPTO.
[10] Dario Fiore,et al. On the (In)Security of SNARKs in the Presence of Oracles , 2016, TCC.
[11] Nir Bitansky,et al. On the existence of extractable one-way functions , 2014, SIAM J. Comput..
[12] Eran Tromer,et al. Proof-Carrying Data and Hearsay Arguments from Signature Cards , 2010, ICS.
[13] Alexandra Boldyreva,et al. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .
[14] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[15] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[16] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[17] Rafail Ostrovsky,et al. Sequential Aggregate Signatures and Multisignatures Without Random Oracles , 2006, EUROCRYPT.
[18] Vinod Vaikuntanathan,et al. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.
[19] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[20] Ivan Damgård,et al. Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..
[21] Michael Clear,et al. Multi-identity and Multi-key Leveled FHE from Learning with Errors , 2015, CRYPTO.
[22] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[23] Kai-Min Chung,et al. Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs , 2015, CRYPTO.
[24] Yuval Ishai,et al. Scalable Multiparty Computation with Nearly Optimal Work and Resilience , 2008, CRYPTO.
[25] Rachid Guerraoui,et al. Fast byzantine agreement , 2013, PODC '13.
[26] Rafael Pass,et al. Limits of Extractability Assumptions with Distributional Auxiliary Input , 2015, ASIACRYPT.
[27] Rajeev Rastogi,et al. Data Stream Management: Processing High-Speed Data Streams (Data-Centric Systems and Applications) , 2019 .
[28] Shafi Goldwasser,et al. Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting , 2013, TCC.
[29] Abhi Shelat,et al. How to Use SNARKs in Universally Composable Protocols , 2015, IACR Cryptol. ePrint Arch..
[30] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[31] Silvio Micali,et al. Accountable-subgroup multisignatures: extended abstract , 2001, CCS '01.
[32] Ron Rothblum,et al. Spooky Encryption and Its Applications , 2016, CRYPTO.
[33] Andrew McGregor,et al. Graph stream algorithms: a survey , 2014, SGMD.
[34] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[35] Nir Bitansky,et al. Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.
[36] Jared Saia,et al. Millions of Millionaires: Multiparty Computation in Large Networks , 2014, IACR Cryptol. ePrint Arch..
[37] Jared Saia,et al. Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation , 2013, ICDCN.
[38] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[39] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[40] Daniel Wichs,et al. Two Round Multiparty Computation via Multi-key FHE , 2016, EUROCRYPT.
[41] Brent Waters,et al. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.
[42] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[43] Matthew Green,et al. Accountable Privacy for Decentralized Anonymous Payments , 2016, Financial Cryptography.
[44] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.