More Communication Lower Bounds for Information-Theoretic MPC
暂无分享,去创建一个
[1] Anna Gál,et al. Lower bounds on the amount of randomness in private computation , 2003, STOC '03.
[2] Ivan Damgård,et al. Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing , 2019, IACR Cryptol. ePrint Arch..
[3] Eyal Kushilevitz,et al. Privacy and communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] Vipul Goyal,et al. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery , 2019, IACR Cryptol. ePrint Arch..
[5] Eyal Kushilevitz,et al. A Randomnesss-Rounds Tradeoff in Private Computation , 1994, CRYPTO.
[6] Alfredo De Santis,et al. Randomness complexity of private computation , 1999, computational complexity.
[7] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[8] Eyal Kushilevitz,et al. A Communication-Privacy Tradeoff for Modular Addition , 1993, Inf. Process. Lett..
[9] Ignacio Cascudo,et al. Amortized Complexity of Information-Theoretically Secure MPC Revisited , 2018, IACR Cryptol. ePrint Arch..
[10] Vinod M. Prabhakaran,et al. On the Communication Complexity of Secure Computation , 2013, IACR Cryptol. ePrint Arch..
[11] Rafail Ostrovsky,et al. Unconditionally Secure Computation with Reduced Interaction , 2016, EUROCRYPT.
[12] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[13] Ivan Damgård,et al. On the Communication Required for Unconditionally Secure Multiplication , 2016, CRYPTO.
[14] D SIAMJ.. RANDOMNESS IN PRIVATE COMPUTATIONS , 1997 .
[15] Ivan Damgård,et al. Scalable and Unconditionally Secure Multiparty Computation , 2007, CRYPTO.
[16] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[17] Eyal Kushilevitz,et al. A Randomness-Rounds Tradeoff in Private Computation , 1994, SIAM J. Discret. Math..
[18] Moni Naor,et al. A minimal model for secure computation (extended abstract) , 1994, STOC '94.
[19] Ian Parberry,et al. The Pairwise Sorting Network , 1992, Parallel Process. Lett..