Results 211 to 220 of about 7,889 (254)
Toward owner governance in genomic data privacy with Governome. [PDF]
Cell Rep MethodsZhang J +8 more
europepmc +1 more source
Constructive <i>Q</i>-Matrix Identifiability via Novel Tensor Unfolding. [PDF]
PsychometrikaGu Y.
europepmc +1 more source
Zero-knowledge proofs of retrievability [PDF]
Science China Information Sciences, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongxin Hu, Gail-Joon Ahn, Yan Zhu
exaly +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 +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
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
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 +3 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 +3 more sources