Results 241 to 250 of about 8,896,164 (281)
Some of the next articles are maybe not open access.

Related searches:

On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing, 1996
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.
Oded Goldreich, Hugo Krawczyk
exaly   +3 more sources

Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge [PDF]

open access: yesLecture Notes in Computer Science, 2018
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard assumptions. The proofs obtained via our framework are proofs
Geoffroy Couteau
exaly   +5 more sources

Zero-knowledge proofs of identity

Journal of Cryptology, 1987
In 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   +3 more sources

A zero-knowledge proof system for OpenLibra

Proceedings of the 22nd International Middleware Conference: Demos and Posters, 2021
Zero-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

A Survey on Zero-Knowledge Proofs

2014
Abstract 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

Zero-Knowledge Proofs

2022
This chapter presents some of the most influential notions and results concerning zero-knowledge (ZK) proofs, discussing both theoretical and practical achievements. ZK proofs are extremely powerful. They can be used to enforce honest computations and therefore they simplify the task of designing cryptographic protocols.
openaire   +4 more sources

Zero-Knowledge Proofs

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

Home - About - Disclaimer - Privacy