Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in gny logic

Synthese

Volumn 149, Issue 2, 2006, Pages 409-443

  Teepe, Wouter ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646480213     PISSN: 00397857     EISSN: 15730964     Source Type: Journal    
DOI: 10.1007/s11229-005-3879-4     Document Type: Conference Paper

References (34)

1. Abadi, M. and M. Tuttle: 1991, "A Semantics for a Logic of Authentication', in Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing. Montreal, pp. 201-216.
2. Agray, N., W. van der Hoek. and E. P. de Vink: 2001. On BAN Logics for Industrial Security Protocols', in B. Dunin-Kȩplicz and E. Nawarecki (eds.). Proceedings of the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems, Cracow, pp. 29-36.
3. Bakhtiari, S., R. Safavi-Naini, and J. Pieprzyk: 1995, 'Cryptographic Hash Functions: A Survey', Technical Report 95-09, Department of Computer Science. University of Wollongong.
4. Bellare, M. and O. Goldreich: 1993. "On Defining Proofs of Knowledge', in E. Brickell (ed.), Advances in Cryptologv: Crypto '93 Proceedings, Vol. 740, Springer Verlag, Berlin, pp. 390-420.
5. Bellare, M., R. Guerin, and P. Rogaway: 1995, "XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions', in D. Coppersmith (ed.). Advances in Cryptologv: Crypto '95 Proceedings, Lecture Notes in Computer Science, Vol. 963. Springer Verlag. Berlin, pp. 15-28.
6. Blum, M., P. Feldman. and S. Micali: 1988. "Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)', in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago. IL, pp. 103-112.
7. Boudot, F., B. Schoenmakers. and I Traoré: 2001. "A Fair and Efficient Solution to the Socialist Millionaires' Problem'. Discrete Applied Mathematics 111(1-2). 23-36.
8. Burrows, M., M. Abadi, and R. Needham: 1990. "A Logic of Authentication'. ACM Transactions on Computer Systems 8(1), 18-36.
9. Canetti, R., D. Micciancio. and O. Reingold: 1998, 'Perfectly One-way Probabilistic Hash Functions (Preliminary Version)', in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing. Dallas, pp. 131-140.
10. Damgård. I.: 1988. "Collision Free Hash Functions and Public Key Signature Schemes', in D. Chaurn and W. Price (eds.). EUROCRYPT. Lecture Notes in Computer Science, Vol. 304. Springer Verlag, Berlin, pp. 203-216.
11. Fagin, R., M. Naor, and P. Winkler: 1996, 'Comparing Information Without Leaking It', Communications of the ACM 39(5). 77-85.
12. Feigenbaum. J., M. Liberman, and R. Wright: 1991. 'Cryptographic Protection of Databases and Software', in. T. Feigenbaum and M. Merritt (eds.). Distributed Computing and Cryptography, Vol. 2. pp. 161-172.
13. Feigenbaum, J., E. Grosse, and J. Reeds: 1992, "Cryptographic Protection of Membership Lists', Newsletter of the International Association for Cryptologic Research 9(1). 16-20.
14. Freedman. M. J., K. Nissim. and B. Pinkas: 2004. "Efficient Private Matching and Set Intersection', in C. Cachin and J. Camenisch (eds.). Advances in Cryptology EUROCRYPT 2004, Lecture Notes in Computer Science. Vol. 2037, Springer Verlag, Berlin, pp. 1-19.
15. Goldreich, O.: 2002. "Zero-knowledge Twenty Years after its Invention', Technical report, Department of Computer Science, Weizmann Institute of Science.
16. Goldreich. O., S. Micali. and A. Wigderson: 1991. 'Proofs that Yield Nothing But their Validity or All Languages in NP have Zero-Knowledge Proofs'. JACM 38. 691-729.
17. Goldwasser. S., S. Micali, and C. Rackoff: 1985. 'The Knowledge Complexity of Interactive Proof-systems', in Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, Providence, RI, pp. 291-304.
18. Gong. L., R. Needham. and R. Yahalom: 1990. 'Reasoning About Belief in Cryptographic Protocols', in D. Cooper and T. Lunt (eds.). Proceedings 1990 IEEE Symposium on Research in Security and Privacy, IEEE Computer Society Press, Los Angeles, pp. 234-248.
19. Jakobsson, M. and M. Yung: 1996, 'Proving without Knowing: On Oblivious. Agnostic and Blindfolded Provers', in N. Koblitz (ed.), Advances in Cryptology: Crypto '96 Proceedings, Lecture Notes in Computer Science, Vol. 1109. Springer Verlag. Berlin, pp. 186-200.
20. Lowe, G: 1996. "Breaking and Fixing the Needham-Schroeder Public-key Protocol Using FDR', in Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Vol. 1055, Springer-Verlag, Berlin, pp. 147-166.
21. Naor, M. and B. Pinkas: 1999. 'Oblivious Transfer and Polynomial Evaluation', in Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing. ACM Press. New York, pp. 245-254.
22. Naor, M. and M. Yung: 1989, 'Universal One-way Hash Functions and their Cryptographic Applications', in Proceedings of the Twenty First Annual ACM Symposium on Theorv of Computing, May 15-17 1989: Seattle, WA, USA, ACM Press. New York, pp." 33-43.
23. National Institute of Standards and Technology: 1992. 'Proposed Federal Information Processing Standard for Secure Hash Standard'. Federal Register 57(21). 3747-3749.
24. Nessett, D. M.: 1990, 'A Critique of the Burrows. Abadi and Needham Logic'. ACM SIGOPS Operating Systems Review 24(2), 35-38.
25. Preneel, B. and P. van Oorschot: 1995. "MDx-MAC and Building Fast MACs from Hash Functions', in D. Coppersmith (ed.), Advances in Cryptology: Crypto '95 Proceedings, Lecture Notes in Computer Science. Vol. 963. Springer Verlag. Berlin, pp. 1-14.
26. Schneier, B.: 1996, Applied Cryptography, John Wiley & Sons. New York.
27. Teepe, W.: 2004a, 'New Protocols for Proving Knowledge of Arbitrary Secrets while not Giving them away", in P. McBurney, W van der Hoek. and M. Wooldridge (eds.). Proceedings of the First Knowledge and Games Workshop. University of Liverpool, Liverpool, pp. 99-116.
28. Teepe, W.: 2004b. "The Secret Prover'. http://www.ai.rug.nl/~woutr/ provingsecrets.
29. Tsudik, G.: 1992. "Message Authentication with One-Way Hash Functions", in Proceedings of IEEE INFOCOM 1992. IEEE Computer Society Press. Los Angeles, pp. 2055-2059.
30. van Ditmarsch. H.: 2003, 'The Russian Cards Problem". Studio Logica 75, 31-62.
31. Watanabe, Y., J. Shikata. and H. Imai: 2003. 'Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks', in Y Desmedt (ed.). Proceedings of International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2003), Lecture Notes in Computer Science. Vol. 2567. Springer-Verlag, Berlin, pp. 71-84.
32. Yao, A.: 1982. "Protocols for Secure Computations', in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press. Los Angeles, pp. 160-164.
33. Yao, A.: 1986, "How to Generate and Exchange Secrets", in Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, pp. 162-167.
34. Zheng, Y. T. Mashumoto, and H. Imai: 1990, "Provably Secure One-Way Hash Functions', in 1990 Workshop on Cryptography and Information Security. Hiroshima.