Concept
Preuve à divulgation nulle de connaissance
Publications associées (54)
Exploring SIDH-Based Signature Parameters
Tako Boris Fouotsa, Laurane Chloé Angélina Marco, Andrea Basso
Isogeny-based cryptography is an instance of post-quantum cryptography whose fundamental problem consists of finding an isogeny between two (isogenous) elliptic curves E and E′. This problem is closely related to that of computing the endomorphism ring of ...
Springer2024EOS: Efficient Private Delegation of zkSNARK Provers
Alessandro Chiesa, Yinuo Zhang
Succinct zero knowledge proofs (i.e. zkSNARKs) are powerful cryptographic tools that enable a prover to convince a verifier that a given statement is true without revealing any additional information. Their attractive privacy properties have led to much ac ...
Berkeley2023Spatial Isolation Implies Zero Knowledge Even in a Quantum World
Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physical assu ...
ASSOC COMPUTING MACHINERY2022On Succinct Non-interactive Arguments in Relativized Worlds
Succinct non-interactive arguments of knowledge (SNARKs) are cryptographic proofs with strong efficiency properties. Applications of SNARKs often involve proving computations that include the SNARK verifier, a technique called recursive composition. Unfort ...
SPRINGER INTERNATIONAL PUBLISHING AG2022A PCP Theorem for Interactive Proofs and Applications
The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...
SPRINGER INTERNATIONAL PUBLISHING AG2022Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier
Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs. We present an IOP that simultaneously achieves the properties of zer ...
SPRINGER INTERNATIONAL PUBLISHING AG2022Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness ...
IEEE COMPUTER SOC2022Orthos: A Trustworthy AI Framework for Data Acquisition
Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos
Information acquisition through crowdsensing with mobile agents is a popular way to collect data, especially in the context of smart cities where the deployment of dedicated data collectors is expensive and ineffective. It requires efficient information el ...
Springer2021