Results 11 to 20 of about 9,266,244 (284)
Cybersecurity, 2018 Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting even when adversaries can simultaneously corrupt multiple provers and verifiers.
Zhenbin Yan, Yi Deng, Yiru Sun
doaj +2 more sources
Protocols for Stateful Zero-Knowledge. [PDF]
, 2022 Privacy preserving protocols typically involve the use of Zero Knowledge (ZK) proofs, which allow a prover to prove that a certain statement holds true, to a verifier, without revealing the witness (secret information that allows one to verify whether said statement holds true) to the verifier.
DAMODARAN, Aditya Shyam Shankar
core +3 more sources
Resettable Statistical Zero Knowledge [PDF]
, 2012 Two central notions of Zero Knowledge that provide strong, yet seemingly incomparable security guarantees against malicious verifiers are those of Statistical Zero Knowledge and Resettable Zero Knowledge. The current state of the art includes several feasibility and impossibility results regarding these two notions separately.
Sanjam Garg +3 more
openaire +5 more sources
Zero Knowledge and Circuit Minimization
Information and Computation, 2014 We show that every problem in the complexity class SZK (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (MCSP). In particular Graph Isomorphism lies in RPMCSP. This is the first theorem relating the computational power of Graph Isomorphism and MCSP, despite the long history these problems share, as candidate NP ...
Eric Allender, Bireswar Das
openaire +3 more sources
Precise Concurrent Zero Knowledge [PDF]
, 2008 Precise zero knowledge introduced by Micali and Pass (STOC'06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worst-case) time spent by V in the generated view. We provide the first constructions of precise concurrent zero-knowledge protocols.
Omkant Pandey +4 more
core +7 more sources
A Zero-Knowledge Proof System with Algebraic Geometry Techniques [PDF]
Applied Sciences, 2020 Current requirements for ensuring data exchange over the internet to fight against security breaches have to consider new cryptographic attacks. The most recent advances in cryptanalysis are boosted by quantum computers, which are able to break common ...
Edgar González Fernández +2 more
doaj +2 more sources
Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC), 2021 Zero-Knowledge proofs (ZKPs) enable proving of mathematical statements, revealing nothing but their validity. We design an authentication sys-tem with a ZKP as a password verification mech-anism within the Extensible Authentication Pro-tocol (EAP) framework.
Jakob Jakob Povšič, Andrej Brodnik
openaire +4 more sources
ZPiE: Zero-Knowledge Proofs in Embedded Systems
Mathematics, 2021 Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to another party that the former knows some information while keeping it secret.
Xavier Salleras, Vanesa Daza
doaj +1 more source
Circuitree: A Datalog Reasoner in Zero-Knowledge
IEEE Access, 2022 Driven by the increased consciousness in data ownership and privacy, zero-knowledge proofs (ZKPs) have become a popular tool to convince a third party of the truthfulness of a statement without disclosing any further information.
Tom Godden +5 more
doaj +1 more source
ZAC: Efficient Zero-Knowledge Dynamic Universal Accumulator and Application to Zero-Knowledge Elementary Database [PDF]
, 2022 —Zero-knowledge universal accumulator generates the succinct commitment to a set and produces the short (non) membership proof (universal) without leaking information about the set (zero-knowledge).
Tran Viet Xuan Phuong +7 more
core +1 more source