Best Possible Information-Theoretic MPC
暂无分享,去创建一个
Yuval Ishai | Eyal Kushilevitz | Shai Halevi | Tal Rabin | S. Halevi | T. Rabin | E. Kushilevitz | Y. Ishai
[1] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[2] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[3] Anat Paskin-Cherniavsky,et al. Non-Interactive Secure Multiparty Computation , 2014, IACR Cryptol. ePrint Arch..
[4] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[5] Yuval Ishai,et al. Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation , 2005, TCC.
[6] Silvio Micali,et al. The All-or-Nothing Nature of Two-Party Secure Computation , 1999, CRYPTO.
[7] Eyal Kushilevitz,et al. A Zero-One Law for Boolean Privacy (extended abstract) , 1989, STOC 1989.
[8] Yehuda Lindell,et al. Secure Computation on the Web: Computing without Simultaneous Interaction , 2011, IACR Cryptol. ePrint Arch..
[9] David Chaum,et al. The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.
[10] Yuval Ishai,et al. Efficient Multi-party Computation over Rings , 2003, EUROCRYPT.
[11] Eyal Kushilevitz,et al. Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[12] Yehuda Lindell,et al. Black-box constructions for secure computation , 2006, STOC '06.
[13] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[14] Josh Benaloh,et al. Secret sharing homomorphisms: keeping shares of a secret secret , 1987, CRYPTO 1987.
[15] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[16] Guy N. Rothblum,et al. On Best-Possible Obfuscation , 2007, TCC.
[17] David Chaum,et al. The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities , 1989, CRYPTO.
[18] Peter Winkler,et al. Comparing information without leaking it , 1996, CACM.
[19] Hugo Krawczyk,et al. Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion , 2017, IACR Cryptol. ePrint Arch..
[20] Yuval Ishai,et al. Ligero: Lightweight Sublinear Arguments Without a Trusted Setup , 2017, Designs, Codes and Cryptography.
[21] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[22] Manoj Prabhakaran,et al. Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC , 2018, ICALP.
[23] Ueli Maurer,et al. Player Simulation and General Adversary Structures in Perfect Multiparty Computation , 2000, Journal of Cryptology.
[24] Yuval Ishai,et al. Secure Multiparty Computation with General Interaction Patterns , 2016, IACR Cryptol. ePrint Arch..
[25] Benny Pinkas,et al. Efficient Circuit-based PSI via Cuckoo Hashing , 2018, IACR Cryptol. ePrint Arch..
[26] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[27] Yuval Ishai,et al. Compressing Cryptographic Resources , 1999, CRYPTO.
[28] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[29] Ueli Maurer,et al. Graceful Degradation in Multi-Party Computation (Extended Abstract) , 2011, ICITS.
[30] Yuval Ishai,et al. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator , 2005, CRYPTO.
[31] Yuval Ishai,et al. Randomizing polynomials: A new representation with applications to round-efficient secure computation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[32] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[33] Martín Abadi,et al. On Hiding Information from an Oracle (Extended Abstract) , 1987, Symposium on the Theory of Computing.
[34] Yuval Ishai,et al. Non-Interactive Multiparty Computation Without Correlated Randomness , 2017, ASIACRYPT.
[35] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[36] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.