On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

Source URL: eprint.iacr.org

• Algebra
• Mathematics
• Multilinear algebra
• Non-interactive zero-knowledge proof
• Proof theory
• IP
• Snark
• Zero-knowledge proof
• Zero knowledge
• Soundness
• Bilinear map
• Model theory

A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16

Source URL: caramba.inria.fr

• Geometry
• Mathematics
• Space
• Analytic number theory
• Elliptic curve
• Group theory
• Curve

Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography Alfred Menezes1 , Palash Sarkar2 , and Shashank Singh3 1 Department of Combinatorics & Optimization, University of Water

Source URL: eprint.iacr.org

• Algebra
• Mathematics
• Polynomials
• Computer algebra
• Integer factorization algorithms
• Finite fields
• Special number field sieve
• General number field sieve
• Irreducible polynomial
• Discrete logarithm
• Factorization
• Resultant

A New Family of Pairing-Friendly elliptic curves Michael Scott1 and Aurore Guillevic2 1 2

Source URL: www.waifi.org

• Abstract algebra
• Algebra
• Geometry
• Finite fields
• Elliptic curve cryptography
• Elliptic curves
• Analytic number theory
• Elliptic curve
• Group theory
• Curve
• Elliptic-curve cryptography
• Supersingular elliptic curve

PDF Document

Source URL: 2012.pairing-conference.org

PDF Document

Source URL: 2012.pairing-conference.org

PDF Document

Source URL: 2012.pairing-conference.org

PDF Document

Source URL: 2012.pairing-conference.org

PDF Document

Source URL: 2012.pairing-conference.org