On Diophantine complexity and statistical zero-knowledge arguments

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

Volumn 2894, Issue , 2003, Pages 398-415

  Lipmaa, Helger ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Arguments of knowledge; Diophantine complexity; Integer commitment scheme; Statistical zero knowledge

Indexed keywords

SECURITY OF DATA;

ARGUMENTS OF KNOWLEDGE; CRYPTOGRAPHIC PROTOCOLS; DESIGN COMMUNICATION; DIOPHANTINE COMPLEXITY; EXPONENTIAL RELATION; INTEGER COMMITMENT; NONNEGATIVE INTEGERS; STATISTICAL ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 0345058958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_26     Document Type: Article

References (24)

1. Leonard M. Adleman and Kenneth L. Manders. Diophantine Complexity. In 17th Annual Symposium on Foundations of Computer Science, pages 81-88, Houston, Texas, USA, 25-27 October 1976. IEEE Computer Society Press.
2. Fabrice Boudot. Efficient Proofs that a Committed Number Lies in an Interval. In Bart Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431-444, Bruges, Belgium, May 14-18 2000. Springer-Verlag. ISBN 3-540-67517-5.
3. Stefan Brands. Rapid Demonstration of Linear Relations Connected by Boolean Operators. In Fumy [Fum97], pages 318-333.
4. Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers. A Secure and Optimally Efficient Multi-Authority Election Scheme. In Fumy [Fum97], pages 103-118.
5. Henri Cohen. A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, 1995.
6. Martin Davis. Hilbert's Tenth Problem is Unsolvable. American Mathematical Monthly, 80(3):233-269, March 1973.
7. Ivan Damgård and Eiichiro Fujisaki. An Integer Commitment Scheme Based on Groups with Hidden Order. In Yuliang Zheng, editor, Advances on Cryptology - ASIACRYPT 2002, volume 2501 of Lecture Notes in Computer Science, pages 125-142, Queenstown, New Zealand, December 1-5 2002. Springer-Verlag.
8. Ivan Damgård and Mads Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Kwangjo Kim, editor, Public Key Cryptography '2001, volume 1992 of Lecture Notes in Computer Science, pages 119-136, Cheju Island, Korea, 13-15 February 2001. Springer-Verlag.
9. Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Transaction of Fundamentals of Electronic Communications and Computer Science, E82-A(1):81-92, January 1999.
10. Amos Fiat and Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Andrew M. Odlyzko, editor, Advances in Cryptology-CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194, Santa Barbara, California, USA, 11-15 August 1986. Springer-Verlag, 1987.
11. Walter Fumy, editor. Advances in Cryptology - EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, Konstanz, Germany, 11-15 May 1997. Springer-Verlag.
12. J. P. Jones and Yuri Matiyasevich. Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets. Journal of Symbolic Logic, 49:818-829, 1984.
13. Marc Joye and Jean-Jacques Quisquater. Efficient Computation of Full Lucas Sequences. Electronics Letters, 32(6):537-538, March 1996.
14. James P. Jones, Daihachiro Sato, Hideo Wada, and Douglas Wiens. Diophantine Representation of the Set of Prime Numbers. American Mathematical Monthly, 83(6):449-464, June-July 1976.
15. Helger Lipmaa, N. Asokan, and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. In Matt Blaze, editor, Financial Cryptography - Sixth International Conference, volume 2357 of Lecture Notes in Computer Science, pages 87-101, Southampton Beach, Bermuda, March 11-14 2002. Springer-Verlag.
16. Helger Lipmaa. Statistical Zero-Knowledge Proofs from Diophantine Equations. Cryptology ePrint Archive, Report 2001/086, November 20 2001. http://eprint.iacr.org/.
17. Yuri Matiyasevich. Enumerable Sets are Diophantine. Soviet Math., Doklady, 11:354-358, 1970. English translation.
18. Yuri Matiyasevich. Hilbert's Tenth Problem. Foundations of Computing. MIT Press, October 1993. ISBN 0-262-13295-8.
19. Yuri Matiyasevich and Julia Robinson. Reduction of an Arbitrary Diophantine Equation to One in 13 Unknowns. Acta Arithmetics, 27:521-553, 1975.
20. Chris Pollett. On the Bounded Version of Hilbert's Tenth Problem. Archive for Mathematical Logic, 42(5):469-488, 2003.
21. Guillaume Poupard and Jacques Stern. Short Proofs of Knowledge for Factoring. In Hideki Imai and Yuliang Zheng, editors, Public Key Cryptography '2000, volume 1751 of Lecture Notes in Computer Science, pages 147-166, Melbourne, Victoria, Australia, 18-20 January 2000. Springer-Verlag.
22. Julia Robinson. Existential Definability in Arithmetic. Transactions of the American Mathematical Society, 72(3):437-449, May 1952.
23. Michael O. Rabin and Jeffrey O. Shallit. Randomized Algorithms in Number Theory. Communications in Pure and Applied Mathematics, 39:239-256, 1986.
24. Hugh C. Williams. A p + 1 Method of Factoring. Mathematics of Computation, 39:225-234, 1982.