A new protocol for conditional disclosure of secrets and its applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4521 LNCS, Issue , 2007, Pages 207-225

  Laur, Sven ^a   Lipmaa, Helger ^b  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Conditional disclosure of secrets; Crypto computing; Homomorphic encryption; Oblivious transfer; Two party computation

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; QUERY PROCESSING; SERVERS; TELECOMMUNICATION NETWORKS; VERIFICATION;

CONDITIONAL DISCLOSURE OF SECRETS; CRYPTO-COMPUTING; HOMOMORPHIC ENCRYPTION; OBLIVIOUS TRANSFER; TWO-PARTY COMPUTATION;

NETWORK PROTOCOLS;

EID: 38049016843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_14     Document Type: Conference Paper

References (27)

1. William Aiello, Yuval Ishai, and Orner Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In Advances in Cryptology - EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, 2001. Springer-Verlag.
2. Dan Boneh, Eu-Jin Goh, and Kobbi Nissim. Evaluating 2-DNF Formulas on Ciphertexts. In The Second Theory of Cryptography Conference, TCC 2005, volume 3378 of Lecture Notes in Computer Science, 2005. Springer Verlag.
3. Ian F. Blake and Vladimir Kolesnikov. Strong Conditional Oblivious Transfer and Computing on Intervals. In Advances on Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, 2004. Springer-Verlag.
4. Josh Benaloh and Jerry Leichter. Generalized Secret Sharing and Monotone Functions. In Advances in Cryptology-CRYPTO '88, volume 403 of Lecture Notes in Computer Science, 1988. Springer-Verlag, 1990.
5. Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, 1997. Springer-Verlag.
6. Yan-Cheng Chang. Single Database Private Information Retrieval with Logarithmic Communication. In The 9th Australasian Conference on Information Security and Privacy (ACISP 2004), volume 3108 of Lecture Notes in Computer Science, 2004. Springer-Verlag.
7. Ivan Damgård and Mads Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Public Key Cryptography 2001, volume 1992 of Lecture Notes in Computer Science, 2001. Springer-Verlag.
8. Taher Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4), 1985.
9. Marc Fischlin. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. In Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, volume 2020 of Lecture Notes in Computer Science, 2001. Springer-Verlag.
10. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, 2004. Springer-Verlag.
11. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting Data Privacy in Private Information Retrieval Schemes. Journal of Computer and System Sciences, 60(3), June 2000.
12. Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On Private Scalar Product Computation for Privacy-Preserving Data Mining. In Information Security and Cryptology - ICISC 2004, volume 3506 of Lecture Notes in Computer Science, 2004. Springer-Verlag.
13. Shafi Goldwasser and Silvio Micali. Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 1982. ACM.
14. Craig Gentry and Zulfikar Ramzan. Single-Database Private Information Retrieval with Constant Communication Rate. In The 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, volume 3580 of Lecture Notes in Computer Science, 2005. Springer-Verlag.
15. Yael Tauman Kalai. Smooth Projective Hashing and Two-Message Oblivious Transfer. In Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, 2005. Springer-Verlag.
16. Lea Kissner and Dawn Song. Privacy-Preserving Set Operations. In Advances in Cryptology - CRYPTO 2005, 25th Annual International Cryptology Conference, volume 3621 of Lecture Notes in Computer Science, 2005. Springer-Verlag.
17. Helger Lipmaa, N. Asokan, and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. In Financial Cryptography - Sixth International Conference, volume 2357 of Lecture Notes in Computer Science, 2002. Springer-Verlag.
18. Hendrik W. Lenstra, Jr. Factoring integers with Elliptic Curves. Annals of Mathematics, 126(2), 1987.
19. Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. In The 8th Information Security Conference (ISC'05), volume 3650 of Lecture Notes in Computer Science, 2005. Springer-Verlag.
20. Sven Laur, Helger Lipmaa, and Tanel Mielikäinen. Private Itemset Support Counting. In Information and Communications Security, 7th International Conference, ICICS 2005, volume 3783 of Lecture Notes in Computer Science, 2005. Springer-Verlag.
21. Moni Naor and Benny Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, 1999. ACM Press.
22. Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, 1999. Springer-Verlag.
23. Julien P. Stern. A New and Efficient All or Nothing Disclosure of Secrets Protocol. In Advances on Cryptology - ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, 1998. Springer-Verlag.
24. 1. In 40th Annual Symposium on Foundations of Computer Science, 1999. IEEE Computer Society.
25. Rebecca N. Wright and Zhiqiang Yang. Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data. In Proceedings of The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004. ACM.
26. Paul Zimmermann and Bruce Dodson. 20 Years of ECM. In The Algorithmic Number Theory Symposium, volume 4076 of Lecture Notes in Computer Science, 2006. Springer-Verlag.
27. Paul Zimmermann. Optimal Parameters for ECM. Available at http://www.loria.fr/~zimmerma/records/ecm/params.html, as of May, 2006.