Zero-knowledge proofs of identity
Journal of Cryptology
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
On hiding information form an oracle
Journal of Computer and System Sciences
Minimum-knowledge interactive proofs for decision problems
SIAM Journal on Computing
Divertible zero knowledge interactive proofs and commutative random self-reducibility
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Interactive bi-proof systems and undeniable signature schemes
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison
ISC '01 Proceedings of the 4th International Conference on Information Security
Publicly Verifiable Auctions with Minimal Leakage
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
A New Protocol for the Nearby Friend Problem
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Proofs for two-server password authentication
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient robust private set intersection
International Journal of Applied Cryptography
Private proximity testing with an untrusted server
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
| Hi-index | 0.00 |
We introduce oblivious decision proofs and agnostic decision proofs. In the former, the prover does not have to know whether the instance is in the language proven or not in order to be able to perform the decision proof; in the latter, the prover cannot even find out this information from interacting in the protocol. The proofs are minimum-knowledge, limiting the knowledge exposed to the verifier as well. We demonstrate an easily distributable oblivious computational minimum-knowledge decision proof protocol for proving validity/invalidity of undeniable signatures. This method, using obliviousness, solves an open problem [6] or practical value: the distributed verfication of undeniable signatures. We also present an agnostic proof for the same language; an agnostic prover reduces the dissemination of trust in the system; in fact, a prover can be blindfolded and not get to learn the input. As part of the agnostic protocol, and perhaps of independent interest, we exhibit an efficient zero-knowledge proof of knowledge (possession) of both a base and an exponent of an element of a finite group (and similar algebraic structures). Finally, we show a perfect agnostic minimum-knowledge decision proof protocol for quadratic residuosity modulo Blum integers.