Constructions of truly practical secure protocols using standard smartcards

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2008, Pages 491-500

  Hazay, Carmit ^a   Lindell, Yehuda ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SEARCHES; GOVERNMENTAL AGENCY; PRIVATE DATA; SECURE PROTOCOLS; SET INTERSECTION; SIMULATION-BASED SECURITY;

NETWORK SECURITY; SEARCH ENGINES; SMART CARDS;

NETWORK PROTOCOLS;

EID: 70349276910     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1455770.1455832     Document Type: Conference Paper

References (23)

1. G. Aggarwal, N. Mishra and B. Pinkas. Secure Computation of the K'thranked Element. In EUROCRYPT 2004, Springer-Verlag (LNCS 3027), pages 40-55, 2004.
2. Y. Aumann and Y. Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In 4th TCC, Springer-Verlag (LNCS 4392), pages 137-156, 2007.
3. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
4. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1-10, 1988.
5. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(l):143-202, 2000.
6. R. Canetti, Y. Ishai, R. Kumar, M.K. Reiter, R. Rubinfeld and R. Wright. Selective Private Function Evaluation with Applications to Private Statistics. In 2Mh PODC, pages 293-304, 2001.
7. D. Chaum, C. Crepeau and I. Damgard. Multi-party Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
8. B. Chor, N. Gilboa, and M. Naor. Private Information Retrieval by Keywords. Technical Report TR-CS0917, Department of Computer Science, Technion, 1997.
9. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private Information Retrieval. Journal of the ACM, 45(6):965-981, 1998.
10. M.J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. In TCC 2005, Springer-Verlag (LNCS 3378), pages 303-324, 2005.
11. M.J. Freedman, K. Nissim and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004, Springer-Verlag (LNCS 3027), pages 1-19, 2004.
12. O. Goldreich. Foundations of Cryptography: Vol. 1 - Basic Tools. Cambridge University Press, 2001.
13. O. Goldreich. Foundations of Cryptography: Volume 2 - Basic Applications. Cambridge University Press, 2004.
14. O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218-229, 1987.
15. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), pages 77-93, 1990.
16. C. Hazay and Y. Lindell, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In 5th TCC, Springer-Verlag , pages 155-175, 2008.
17. L. Kissner and D.X. Song. Privacy-Preserving Set Operations. In CRYPTO 2005, Springer-Verlag (LNCS 3621), pages 241-257, 2005.
18. E. Kushilevitz, Y. Lindell and T. Rabin. Information-Theoretically Secure Protocols and Security Under Composition. In 38th STOC. pages 109-18, 2006.
19. Y. Lindell and B. Pinkas. Privacy Preserving Data Mining. Journal of Cryptology, 15(3): 177-206, 2002. An extended abstract appeared in CRYPTO 2000.
20. S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
21. M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In 31si STOC, pages 245-254, 1999.
22. M. Witteman. Advances in Smartcard Security. Information Security Bulletin, July 2002, pages 11-22, 2002.
23. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.