Results 11 to 20 of about 15,719 (288)
Zero-Knowledge Proofs of Quantumness [PDF]
IACR Communications in CryptologyWith the rapid development of quantum computers, proofs of quantumness have recently become an interesting and intriguing research direction. However, in all current schemes for proofs of quantumness, quantum provers almost invariably face the risk of being maliciously exploited by classical verifiers.
Phan, Duong Hieu +3 more
core +6 more sources
Zero-Knowledge Proofs of Proximity. [PDF]
IACR Cryptol. ePrint Arch., 2017 Interactive proofs of proximity (IPPs) are interactive proofs in which the verifier runs in time sub-linear in the input length. Since the verifier cannot even read the entire input, following the property testing literature, we only require that the verifier reject inputs that are far from the language (and, as usual, accept inputs that are in the ...
Berman, Itay +2 more
openaire +5 more sources
Zero-knowledge proofs of retrievability [PDF]
Science China Information Sciences, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Zhu 0010 +4 more
openaire +2 more sources
Investment Compliance in Hedge Funds using Zero Knowledge Proofs
The Journal of The British Blockchain Association, 2021 Financial Regulation is a form of compliance system that subjects financial institutions to certain requirements and restrictions. Investment Compliance is an example that involves investment restrictions and monitoring on behalf of investors.
Komal Kalra +2 more
doaj +1 more source
Zero-Knowledge Proof Systems for QMA [PDF]
SIAM Journal on Computing, 2016 Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity ...
Anne Broadbent +3 more
openaire +2 more sources
Zero-Knowledge Proofs and OAuth 2.0 for Anonymity and Security in Distributed Systems [PDF]
E3S Web of Conferences, 2023 —This paper investigates the integration of Zero-Knowledge Proofs (ZKP) and OAuth 2.0 to enhance anonymity and security in multi-agent distributed systems.
Nait Cherif Ayman +5 more
doaj +1 more source
Zero-Knowledge Sets With Short Proofs [PDF]
IEEE Transactions on Information Theory, 2011 Zero knowledge sets (ZKS), introduced by Micali, Rabin, and Kilian in 2003, allow a prover to commit to a secret set S in a way such that it can later prove, non interactively, statements of the form x ∈ S (or x ∉ S), without revealing any further information (on top of what explicitly revealed by the inclusion/exclusion statements above) on S, not ...
Catalano, Dario +3 more
openaire +3 more sources
Twisted Edwards Elliptic Curves for Zero-Knowledge Circuits
Mathematics, 2021 Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blockchain applications, and to current scalability problems that blockchains suffer from.
Marta Bellés-Muñoz +4 more
doaj +1 more source
Proofs, Arguments, and Zero-Knowledge
Foundations and Trends® in Privacy and Security, 2022 Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted prover to provide a guarantee that it performed a requested computation correctly. Introduced in the 1980s, IPs and arguments represented a major conceptual expansion of what constitutes a “proof” that a statement is true.
openaire +1 more source
Doubly adaptive zero-knowledge proofs
, 2023 In [TCC 2009 and JoC 2011] Lindell and Zarosim defined adaptive-corruption zero knowledge giving to the environment the power to perform post-execution corruption only.
Botta V., Visconti I.
core +1 more source