Results 251 to 260 of about 15,719 (288)
Some of the next articles are maybe not open access.
On the communication complexity of zero-knowledge proofs
Journal of Cryptology, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joan Boyar +2 more
exaly +2 more sources
Datenschutz und Datensicherheit (dud)This thesis examine past and modern constructions of zero knowledge proofs. Zero-knowledge proofs were introduced as a method of proving a statement without revealing anything more than the statement itself.
Johannes Sedlmeir, Steffen Schwalm
core +3 more sources
Zero-knowledge proofs of identity
Journal of Cryptology, 1987In this paper we extend the notion of interactive proofs of assertions to interactive proofs of knowledge. This leads to the definition of unrestricted input zero-knowledge proofs of knowledge in which the prover demonstrates possession of knowledge without revealing any computational information whatsover (not even the one bit revealed in zero ...
Uriel Feige, Amos Fiat, Adi Shamir
openaire +2 more sources
A zero-knowledge proof system for OpenLibra
Proceedings of the 22nd International Middleware Conference: Demos and Posters, 2021Zero-knowledge proofs (ZKPs) have garnered much attention recently. They have witnessed applicability in anonymizing tokens (e.g., Tornado Cash) and increasing transaction throughput (e.g., ZK-Rollups) for blockchains backing cryptocurrencies. ZKPs are touted to offer great potential for future blockchain applications that operate in a priori trustless
Patrick Biel +2 more
openaire +1 more source
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge [PDF]
Lecture Notes in Computer Science, 2018 We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs ($$\mathsf {DVNIZK}$$ ) for a wide class of algebraic languages over abelian groups, under standard assumptions.
Geoffroy Couteau, Couteau Geoffroy
exaly +3 more sources
On the composition of zero-knowledge proof systems
SIAM Journal on Computing, 1996Summary: The wide applicability of zero-knowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zero-knowledge protocols is zero-knowledge too. We demonstrate the limitations of the composition
Oded Goldreich 0001, Hugo Krawczyk
openaire +1 more source
A Survey on Zero-Knowledge Proofs
2014Abstract Zero-knowledge proofs (ZKPs) are interactive protocols in which one party, named the prover, can convince the other party, named the verifier, that some assertion is true without revealing anything other than the fact that the assertion being proven is true.
Feng Li, Bruce M. McMillin
openaire +1 more source
The American Mathematical Monthly, 1993
On a moonless night the spy returns to the castle after a reconnoitering mission to the enemy camp. As he nears the gate a voice whispers, "What's the password?" But is it friend or foe who whispers? How can the spy show that he knows the password without actually revealing it to a possible imposter?
openaire +1 more source
On a moonless night the spy returns to the castle after a reconnoitering mission to the enemy camp. As he nears the gate a voice whispers, "What's the password?" But is it friend or foe who whispers? How can the spy show that he knows the password without actually revealing it to a possible imposter?
openaire +1 more source
2015
Suppose Alice has a password and wants to log in to a website run by Bob, but she does not quite trust the computer Bob is using to verify the password. If she just sends the password to Bob then Bob’s computer will learn the whole password. To get around this problem one often sees websites that ask for the first, fourth and tenth letter of a password
openaire +1 more source
Suppose Alice has a password and wants to log in to a website run by Bob, but she does not quite trust the computer Bob is using to verify the password. If she just sends the password to Bob then Bob’s computer will learn the whole password. To get around this problem one often sees websites that ask for the first, fourth and tenth letter of a password
openaire +1 more source
Efficient Zero-Knowledge Proof Systems
2016A proof system can be used by a prover to demonstrate to one or more verifiers that a statement is true. Proof systems can be interactive where the prover and verifier exchange many messages, or non-interactive where the prover sends a single convincing proof to the verifier.
Jonathan Bootle +3 more
openaire +1 more source