Fetching the paper…
Reading the bibliography…
We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs.
P. Elias, “Coding for noisy channels,” IRE Convention Record , vol. 3, Part 4, pp. 37–46, 1955, reprinted in Key Papers in the Development of Coding Theory
1974
Earlier work this paper cites.
A. Wyner, “Recent results in the shannon theory,” IEEE Transactions on information Theory , vol. 20, no. 1, pp. 2–10, 1974
1974
Earlier work this paper cites.
D. Shanks, Solved and unsolved problems in number theory . Chelsea Publishing Company, New York, 1978
1978
Earlier work this paper cites.
J. Korner and K. Marton, “How to encode the modulo-two sum of binary sources,” IEEE Trans. Inform. Theory , vol. 25, pp. 219–221, March 1979
1979
Earlier work this paper cites.
A. C. Yao, “Protocols for secure computations,” in Foundations of Computer Science, 1982. SFCS’08. 23rd Annual Symposium on . IEEE, 1982, pp. 160–164
1982
Earlier work this paper cites.
I. Csiszar, “Linear codes for sources and source networks: Error exponents, universal coding,” IEEE Transactions on Information Theory , vol. 28, no. 4, pp. 585–592, 1982
1982
Earlier work this paper cites.
T. S. Han and K. Kobayashi, “A Dichotomy of Functions F ( x , y ) F(x,y) of Correlated Sources ( X , Y ) (X,Y) from the Viewpoint of the Achievable Rate Region,” IEEE Transactions on Information Theory , vol. 33, no. 1, pp. 69–76, 1987
1987
Earlier work this paper cites.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in Proceedings of the twentieth annual ACM symposium on Theory of computing . ACM, 1988, pp. 1–10
1988
Earlier work this paper cites.
D. Chaum, C. Crépeau, and I. Damgard, “Multiparty unconditionally secure protocols,” in Proceedings of the twentieth annual ACM symposium on Theory of computing . ACM, 1988, pp. 11–19
1988
Earlier work this paper cites.
U. Feige, J. Killian, and M. Naor, “A minimal model for secure computation,” in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing . ACM, 1994, pp. 554–563
1994
Earlier work this paper cites.
Y. Ishai and E. Kushilevitz, “Private simultaneous messages protocols with applications,” in Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems . IEEE, 1997, pp. 174–183
1997
Earlier work this paper cites.
R. Lidl and H. Niederreiter, Finite fields . Cambridge university press, 1997, vol. 20
1997
Earlier work this paper cites.
D. S. Dummit and R. M. Foote, Abstract Algebra . John Wiley & Sons, 2004
2004
Earlier work this paper cites.
B. Nazer and M. Gastpar, “Computation over multiple-access channels,” IEEE Transactions on information theory , vol. 53, no. 10, pp. 3498–3516, 2007
2007
Earlier work this paper cites.
V. Shoup, A computational introduction to number theory and algebra . Cambridge university press, 2009
2009
Earlier work this paper cites.
M. Tărnăuceanu, “An arithmetic method of counting the subgroups of a finite abelian group,” Bulletin mathématique de la Société des Sciences Mathématiques de Roumanie , pp. 373–386, 2010
2010
Earlier work this paper cites.
A. Beimel and I. Orlov, “Secret sharing and non-shannon information inequalities,” IEEE Transactions on Information Theory , vol. 57, no. 9, pp. 5634–5649, 2011
2011
Cited alongside, same era.
R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, “Network coding for computing: Cut-set bounds,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 1015–1030, 2011
2011
Cited alongside, same era.
A. El Gamal and Y.-H. Kim, Network information theory . Cambridge University Press, 2011
2011
Cited alongside, same era.
2011
Cited alongside, same era.
J. Petrillo, “Counting subgroups in a direct product of finite cyclic groups,” The College Mathematics Journal , vol. 42, no. 3, pp. 215–222, 2011
M. Heidari and S. S. Pradhan, “How to compute modulo prime-power sums,” in 2016 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2016, pp. 1824–1828
2016
Later among the works it cites.
H. Sun and S. A. Jafar, “The Capacity of Private Information Retrieval,” IEEE Transactions on Information Theory , vol. 63, no. 7, pp. 4075–4088, 2017
2017
Later among the works it cites.
F. Benhamouda, H. Krawczyk, and T. Rabin, “Robust non-interactive multiparty computation against constant-size collusion,” in Annual International Cryptology Conference . Springer, 2017, pp. 391–419
2017
Later among the works it cites.
A. Beimel, Y. Ishai, and E. Kushilevitz, “Ad hoc PSM protocols: secure computation without coordination,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2017, pp. 580–608
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
H. Cohen, A course in computational algebraic number theory . Springer Science & Business Media, 2013, vol. 138
2013
Cited alongside, same era.
E. J. Lee and E. Abbe, “Two shannon-type problems on secure multi-party computations,” in 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) . IEEE, 2014, pp. 1287–1293
2014
Cited alongside, same era.
A. Beimel, A. Gabizon, Y. Ishai, E. Kushilevitz, S. Meldgaard, and A. Paskin-Cherniavsky, “Non-interactive secure multiparty computation,” in Annual Cryptology Conference . Springer, 2014, pp. 387–404
2014
Cited alongside, same era.
T. Judson, Abstract algebra: theory and applications . Stephen F. Austin State University, 2014
2014
Cited alongside, same era.
D. Data, B. K. Dey, M. Mishra, and V. M. Prabhakaran, “How to securely compute the modulo-two sum of binary sources,” in 2014 IEEE Information Theory Workshop (ITW 2014) . IEEE, 2014, pp. 496–500
2014
Cited alongside, same era.
J. Katz and Y. Lindell, Introduction to modern cryptography . Chapman and Hall/CRC, 2014
2014
Cited alongside, same era.
L. Tóth, “Subgroups of finite abelian groups having rank two via Goursat’s lemma,” Tatra Mountains Mathematical Publications , vol. 59, no. 1, pp. 93–103, 2014
2014
Cited alongside, same era.
S. Kuzuoka and S. Watanabe, “On distributed computing for functions with certain structures,” IEEE Transactions on Information Theory , vol. 63, no. 11, pp. 7003–7017, 2017
2017
Later among the works it cites.
G. Martin and L. Troupe, “The distribution of the number of subgroups of the multiplicative group,” Journal of the Australian Mathematical Society , pp. 1–52, 2017
2017
Later among the works it cites.
K. Banawan and S. Ulukus, “The Capacity of Private Information Retrieval from Coded Databases,” IEEE Transactions on Information Theory , vol. 64, no. 3, pp. 1945–1956, 2018
2018
Later among the works it cites.
B. Applebaum, T. Holenstein, M. Mishra, and O. Shayevitz, “The communication complexity of private simultaneous messages, revisited,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2018, pp. 261–286
2018
Later among the works it cites.
A. Beimel, E. Kushilevitz, and P. Nissim, “The complexity of multiparty PSM protocols and related models,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2018, pp. 287–318
2018
Later among the works it cites.
M. Yoshida and S. Obana, “On the (in) efficiency of non-interactive secure multiparty computation,” Designs, Codes and Cryptography , vol. 86, no. 8, pp. 1793–1805, 2018
2018
Later among the works it cites.
S. Halevi, Y. Ishai, E. Kushilevitz, and T. Rabin, “Best possible information-theoretic MPC,” in Theory of Cryptography Conference . Springer, 2018, pp. 255–281
2018
Later among the works it cites.
C. Huang, Z. Tan, S. Yang, and X. Guang, “Comments on cut-set bounds on network function computation,” IEEE Transactions on Information Theory , vol. 64, no. 9, pp. 6454–6459, 2018
2018
Later among the works it cites.
Y. Zhou, H. Sun, and S. Fu, “On the Randomness Cost of Linear Secure Computation,” in 2019 53rd Annual Conference on Information Sciences and Systems (CISS) , March 2019, pp. 1–6
2019
Later among the works it cites.
L. Assouline and T. Liu, “Multi-Party PSM, Revisited,” Cryptology ePrint Archive, Report 2019/657, 2019, https://eprint.iacr.org/2019/657
2019
Later among the works it cites.
N. Agarwal, S. Anand, and M. Prabhakaran, “Uncovering Algebraic Structures in the MPC Landscape,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2019, pp. 381–406
2019
Later among the works it cites.