Cryptography from anonymity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 239-248

  Ishai, Yuval ^a   Kushilevitz, Eyal ^a   Ostrovsky, Rafail ^b   Sahai, Amit ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of California

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS COMMUNICATION; BUILDING BLOCK; POINT-TO-POINT CHANNELS;

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATION THEORY; INFORMATION RETRIEVAL; PROBLEM SOLVING;

CRYPTOGRAPHY;

EID: 38049021884     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.25     Document Type: Conference Paper

References (52)

1. Anonymity bibliography. http://www.freehaven.net/anonbib/
2. B. Alpern and E B. Schneider. Key exchange Using 'Keyless Cryptography'. Information Processing Letters Vol. 16, pages 79-81, 1983.
3. (2k-1) Barrier for Information-Theoretic Private Information Retrieval. In Proc. 43rd FOCS, pages 261-270, 2002.
4. A. Beimel, Y. Ishai, and T. Malkin. Reducing the servers' computation in private information retrieval: PIR with pre-processing. Journal of Cryptology, 17(2), pages 125-151, 2004. Earlier version in CRYPTO 2000.
5. A. Beimel and T. Malkin. A Quantitative Approach to Reductions in Secure Computation. In Proc. of 1st TCC, pages 238-257, 2004.
6. C. H. Bennett, G. Brassard, and J. M. Robert. Privacy Amplification by Public Discussion. SIAM J. Comput. 17(2): 210-229 (1988).
7. R. Berman, A. Fiat, and A. Ta-Shma. Provable Unlinkability against Traffic Analysis. In Proc. of 8th Financial Cryptography, pages 266-280, 2004.
8. D. Bleichenbacher, A. Kiayias, and M. Yung. Decoding of Interleaved Reed Solomon Codes over Noisy Data. In Proc. of ICALP 2003, pages 97-108.
9. D. Bleichenbacher and P. Q. Nguyen. Noisy Polynomial Interpolation and Noisy Chinese Remaindering. In Proc. of EUROCRYPT 2000, pages 53-69.
10. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In Proc. of EUROCRYPT '99, pages 402-414.
11. R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1), 2000.
12. D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Commun. ACM, Vol. 24(2), pages 84-88, 1981. Also: UC Berkeley M.Sc. Thesis, 1979.
13. David Chaum. Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA. In Proc. EUROCRYPT 1988, pages 177-182.
14. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward Privacy in Public Databases. In Proc. of 2nd TCC, pages 363-385, 2005.
15. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. J. of the ACM, 45:965-981, 1998. Earlier version in FOCS '95.
16. D. Coppersmith and M. Sudan. Reconstructing curves in three (and higher) dimensional space from noisy data. In Proc. of 35th STOC, pages 136-142, 2003.
17. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. of 22nd PODS, pp. 202-210, 2003.
18. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. of 26th STOC, pages 554-563, 1994.
19. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure Multiparty Computation of Approximations. In Proc. 28th ICALP, pages 927-938, 2001.
20. M. J. Fischer and R. N. Wright. Multiparty Secret Key Exchange Using a Random Deal of Cards. In Proc. CRYPTO 1991, pages 141-155.
21. M. Fitzi, J. Garay, U. Maurer, and R. Ostrovsky. Minimal Complete Primitives for Secure Multi-party Computation. In Proc. Crypto 2001, pages 80-100.
22. M. Fitzi, S. Wolf, and J. Wullschleger. Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. In Proc. CRYPTO 2004, pages 562-578.
23. C. Gentry and Z. Ramzan. Single-Database Private Information Retrieval with Constant Communication Rate. In Proc. 32nd ICALP, pages 803-815, 2005.
24. O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
25. V. Guruswami and F. Parvaresh. Personal communication.
26. V. Guruswami and A. Rudra. Explicit Capacity-Achieving List-Decodable Codes. In Proc. 38th STOC, pp. 1-10, 2006.
27. V. Guruswami, and M. Sudan. Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory, Vol. 45(6), pages 1757-1767, 1999. Earlier version in FOCS '98.
28. D. Harnik, M. Naor, O. Reingold, and A. Rosen. Completeness in two-party secure computation: a computational view. In Proc. 36th STOC, pages 252-261, 2004.
29. R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J. Cryptology 9(4), pages 199-216, 1996. Earlier version in FOCS '89.
30. R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In Proc. 30th FOCS, pages 248-253, 1989.
31. Y. Ishai and E. Kushilevitz. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. In Proc. 29th ICALP, pages 244-256, 2002.
32. Y Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Batch codes and their applications. In Proc. 36th STOC, pages 373-382, 2004.
33. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Cryptography from Anonymity. Cryptology ePrint Archive, Report 2006/084, 2006.
34. A. Kiayias and M. Yung. Secure Games with Polynomial Expressions. In Proc. 28th ICALP, pages 939-950, 2001.
35. J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th STOC, pages 20-31, 1988.
36. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000).
37. E. Kushilevitz and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Proc. 38th FOCS, pages 364-373, 1997.
38. H. Lipmaa. An Oblivious Transfer Protocol with LogSquared Communication. In Proc. ISC2005, pages 314-328.
39. U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Transactions on Information Theory 39(3): 733-742, 1993.
40. T. Moran and M. Naor. Basing cryptographic protocols on tamper-evident Seals. In Proc. of 32nd ICALP, pages 285-297, 2005.
41. M. Naor and B. Pinkas. Oblivious polynomial evaluation. SIAM J. Comput. 35(5), pages 1254-1281, 2006. Earlier version in STOC '99.
42. N. Nisan and D. Zuckerman. Randomness is Linear in Space. J. Comput. Syst. Sci., Vol. 52(1), pages 43-52, 1996. Earlier version in STOC '93.
43. F. Parvaresh and A. Vardy. Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time. In Proc. 46th FOCS, pages, 285-294, 2005.
44. A. Pfitzmann and M. Waidner. Networks without user observability - design options. In Proc. Eurocrypt '85, pages 245-253, 1986. Revision in: Computers and Security 6/2 (1987) 158-166.
45. B. Pfitzmann and M. Waidner. Information-Theoretic Pseudosignatures and Byzantine Agreement for t > n/3. IBM Research Report RZ 2882 (#90830), 1996.
46. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In Proc. 21st STOC, pages 73-85, 1989.
47. J. F. Raymond. Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In Workshop on Design Issues in Anonymity and Unobservability, pages 10-29, 2001.
48. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. ACM Trans. Inf. Syst. Secur., 1(1), pages 66-92, 1998.
49. D. R. Simon. Anonymous Communication and Anonymous Cash. In Proc. CRYPTO 1996, pages 61-73.
50. P. L. Vora. Information Theory and the Security of Binary Data Perturbation. In Proc. Indocrypt2004, pages 136-147.
51. P. Winkler. Cryptologie techniques in bidding and defense: Parts I, II, III, and IV. Bridge Magazine, April-July 1981.
52. A. C. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, pages 162-167, 1986.