Secure Games with Polynomial Expressions

By Aggelos Kiayias, M. Yung. 2001

49 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Yuval Ishai
2. Amos Beimel
3. Amit Sahai
4. Benny Pinkas
5. Dan Boneh
6. Brent Waters
7. Dawn Song
8. Kobbi Nissim

In Computer Vision and Pattern Recognition

1. Adrian Perrig
2. Yuval Ishai
3. Brent Waters
4. Aggelos Kiayias
5. M. Yung
6. William I. Gasarch
7. Haowen Chan
8. Amos Beimel

Citations in the corpus

• XPIR : Private Information Retrieval for Everyone (2016, background): “As number theoretic approaches failed to provide efficient cPIR schemes, some alternatives were explored [6, 7, 8], but all of them were based on non-standard problems and have been broken [9, 10, 11, 12, 13].”
• Cryptography from Anonymity (2006, background): “, pc(0)) = s; (10)An attempt to base PIR on a stronger version of our intractabi lity assumption was made in [37].”
• SIA: Secure information aggregation in sensor networks (2003, methodology): “, using a private information retrieval protocol [7, 18].”
• A Survey on Private Information Retrieval (Column: Computational Complexity) (2004, background): “Certain assumptions about oblivious transfer imply 1-DB polylog-bits PIR schemes [45].”
• High-Speed Private Information Retrieval Computation on GPU (2008, background): “However, their security has either been broken [13] or require parameters resulting in unrealistic communication costs [9], and thus they have not been included in our performance comparison.”
• A Survey on Private Information Retrieval (2004, background): “Certain assumptions about oblivious transfer imply 1-DB polylog-bits PIR schemes [46].”
• Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval (2002, background): “PIR was also studied in a computational setting where privacy should only hold against computationally bounded servers; computational PIR was studied in both the multi-server setting [10] and a single server setting [25, 27, 32, 8, 26, 14, 24].”
• Efficient Private Matching and Set Intersection (2004, background): “Combining this result with PIR scheme of Cachin et al. [5] (or of Kiayias and Yung [15]) results in λ polylog(N ) communication, for security parameter λ.”
• Decoding of Interleaved Reed Solomon Codes over Noisy Data (2003, methodology): “Moreover the NBSC model has been used in the cryptographic setting as a way to hide information in schemes that employ intractability assumptions related to the hardness of decoding, see e.g. [ KY01 ].”
• Secure multiparty computation of approximations (2001, background): “3 it suffices to assume specific number-theoretic assumptions from [11] or [36].”
• Polynomial Reconstruction Based Cryptography (2001, methodology): “MPR was defined in [ KY01a ] and further investigated in [BKY01].”