Results 201 to 210 of about 8,603,697 (240)
, 2018 Generally, in mathematics, the goal of a proof is for the writer to convey knowledge and understanding to the reader. (However, you may doubt this claim based on some books or papers you have read or talks you have attended, although surely not any of mine.) But from time to time, the prover wants to obfuscate some key pieces of information.
Kannan Balasubramanian, Mala K.
core +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +3 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
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
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
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
A Survey on Zero-Knowledge Proof in Blockchain
IEEE Network, 2021Blockchain, which is usually regarded as a public, decentralized and distributed ledger, has attracted significant attention recently. In the environment of blockchain, all historical transaction data are recorded and stored. However, because blockchain is open and transparent, a malicious user may illegally access private transaction data, including ...
Xiaoqiang Sun +5 more
openaire +1 more source
Doubly adaptive zero-knowledge proofs
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Botta V., Visconti I.
openaire +2 more sources
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 +2 more sources