Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
暂无分享,去创建一个
Rafail Ostrovsky | Eyal Kushilevitz | Adrian Thillard | Adi Rosén | Emmanuel Prouff | Damien Vergnaud | R. Ostrovsky | E. Kushilevitz | Damien Vergnaud | E. Prouff | A. Rosén | Adrian Thillard
[1] Florent Urrutia,et al. A New Approach to Multi-Party Peer-to-Peer Communication Complexity , 2019, ITCS.
[2] Ivan Damgård,et al. On the Communication Required for Unconditionally Secure Multiplication , 2016, CRYPTO.
[3] Vinod M. Prabhakaran,et al. Communication and Randomness Lower Bounds for Secure Computation , 2016, IEEE Transactions on Information Theory.
[4] Rafail Ostrovsky,et al. Unconditionally Secure Computation with Reduced Interaction , 2015, EUROCRYPT.
[5] Yehuda Lindell,et al. A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation , 2015, Journal of Cryptology.
[6] Anna Gál,et al. Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation , 2005, SIAM J. Comput..
[7] Andreas Jakoby,et al. Private Computations in Networks: Topology versus Randomness , 2003, STACS.
[8] Alfredo De Santis,et al. Randomness complexity of private computation , 1999, computational complexity.
[9] Giuseppe Persiano,et al. Randomness Recycling in Constant-Round Private Computations (extended Abstract) , 1999, DISC.
[10] Anna Gál,et al. A theorem on sensitivity and applications in private computation , 1999, STOC '99.
[11] Rafail Ostrovsky,et al. Characterizing Linear Size Circuits in Terms of Pricacy , 1999, J. Comput. Syst. Sci..
[12] Noam Nisan,et al. Extracting Randomness: A Survey and New Constructions , 1999, J. Comput. Syst. Sci..
[13] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.
[14] Rafail Ostrovsky,et al. Amortizing randomness in private multiparty computations , 1998, PODC '98.
[15] Eyal Kushilevitz,et al. A Randomness-Rounds Tradeoff in Private Computation , 1998, SIAM J. Discret. Math..
[16] Eyal Kushilevitz,et al. Randomness in private computations , 1996, PODC '96.
[17] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.
[18] Eyal Kushilevitz,et al. A Communication-Privacy Tradeoff for Modular Addition , 1993, Inf. Process. Lett..
[19] Eyal Kushilevitz,et al. A zero-one law for Boolean privacy , 1989, STOC '89.
[20] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[21] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[22] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.