International audienceElliptic curves have become key ingredients for instantiating zero-knowledge proofs and more generally proof systems. Recently, there have been many tailored constructions of these curves that aim at efficiently implementing different kinds of proof systems. In this survey we provide the reader with a comprehensive overview on existing work and revisit the contributions in terms of efficiency and security. We present an overview at three stages of the process: curves to instantiate a SNARK, curves to instantiate a recursive SNARK, and also curves to express an elliptic-curve related statement. We provide new constructions of curves for SNARKs and generalize the state-of-the-art constructions for recursive SNARKs. We al...
More than 25 years ago, elliptic curves over finite fields were suggested as a group in which the Di...
Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in bl...
At its core, cryptography relies on problems that are simple to construct but difficult to solve unl...
International audienceElliptic curves have become key ingredients for instantiating zero-knowledge p...
to appearInternational audienceA zero-knowledge proof is a method by which one can prove knowledge o...
A proof system is a protocol where one party (called the prover) tries to convince another party (ca...
International audienceAt CANS'20, El Housni and Guillevic introduced a new 2-chain of pairing-friend...
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptogr...
We propose an approach using elliptic curve-based zero-knowledge proofs in e-commerce applications. ...
International audienceA preliminary step towards the verification of elliptic curve cryptographic al...
Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blo...
Elliptic curves have found widespread use in number theory and applications thereof, such as cryptog...
This thesis is a basic overview of elliptic curves and their applications to Cryptography. We begin ...
Elliptic curves (EC) are widely studied due to their mathematical and cryptographic properties. Cryp...
More than 25 years ago, elliptic curves over finite fields were suggested as a group in which the Di...
Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in bl...
At its core, cryptography relies on problems that are simple to construct but difficult to solve unl...
International audienceElliptic curves have become key ingredients for instantiating zero-knowledge p...
to appearInternational audienceA zero-knowledge proof is a method by which one can prove knowledge o...
A proof system is a protocol where one party (called the prover) tries to convince another party (ca...
International audienceAt CANS'20, El Housni and Guillevic introduced a new 2-chain of pairing-friend...
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptogr...
We propose an approach using elliptic curve-based zero-knowledge proofs in e-commerce applications. ...
International audienceA preliminary step towards the verification of elliptic curve cryptographic al...
Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blo...
Elliptic curves have found widespread use in number theory and applications thereof, such as cryptog...
This thesis is a basic overview of elliptic curves and their applications to Cryptography. We begin ...
Elliptic curves (EC) are widely studied due to their mathematical and cryptographic properties. Cryp...
More than 25 years ago, elliptic curves over finite fields were suggested as a group in which the Di...
Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in bl...
At its core, cryptography relies on problems that are simple to construct but difficult to solve unl...