Publications related to Zero-knowledge proof

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 ...

Springer2024

EOS: 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 ...

Berkeley2023

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Alessandro Chiesa

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 MACHINERY2022

On Succinct Non-interactive Arguments in Relativized Worlds

Alessandro Chiesa

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 AG2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

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 AG2022

Efficient protocols for oblivious linear function evaluation from ring-LWE

Juan Ramón Troncoso-Pastoriza

An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...

IOS PRESS2022

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Alessandro Chiesa, Siqi Liu

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 AG2022

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Orthos: 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

Zero-knowledge proof

Graph Chatbot

Chat with Graph Search

Exploring SIDH-Based Signature Parameters

EOS: Efficient Private Delegation of zkSNARK Provers

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

On Succinct Non-interactive Arguments in Relativized Worlds

A PCP Theorem for Interactive Proofs and Applications

Efficient protocols for oblivious linear function evaluation from ring-LWE

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Orthos: A Trustworthy AI Framework for Data Acquisition

A PCP Theorem for Interactive Proofs and Applications

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Exploring SIDH-Based Signature Parameters

EOS: Efficient Private Delegation of zkSNARK Provers

On Succinct Non-interactive Arguments in Relativized Worlds

Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time Verifier

Efficient protocols for oblivious linear function evaluation from ring-LWE

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

Orthos: A Trustworthy AI Framework for Data Acquisition

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!