On Diophantine Complexity and Statistical Zero-Knowledge Arguments
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Analysis of Bernstein’s Factorization CircuitLecture Notes in Computer Science, 2002
- A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key SystemLecture Notes in Computer Science, 2001
- Efficient Proofs that a Committed Number Lies in an IntervalLecture Notes in Computer Science, 2000
- A Secure and Optimally Efficient Multi-Authority Election SchemeLecture Notes in Computer Science, 1997
- Rapid Demonstration of Linear Relations Connected by Boolean OperatorsLecture Notes in Computer Science, 1997
- Efficient computation of full Lucas sequencesElectronics Letters, 1996
- Register machine proof of the theorem on exponential diophantine representation of enumerable setsThe Journal of Symbolic Logic, 1984
- Diophantine complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976
- Diophantine Representation of the Set of Prime NumbersThe American Mathematical Monthly, 1976
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973