Skip to search formSkip to main contentSkip to account menu
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
TLDR
A zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit and an optimized version of the constant round square root complexity argument of Groth CRYPTO 2009, which reduces both communication and round complexity.
View via Publisher
Short Accountable Ring Signatures Based on DDH
TLDR
A highly efficient instantiation of the generic construction in the random oracle model is given by meticulously combining Camenisch's group signature scheme CRYPTO 1997 with a generalization of the one-out-of-many proofs of knowledge by Groth and Kohlweiss EUROCRYPT 2015.
View via Publisher
On the Security of Supersingular Isogeny Cryptosystems
TLDR
This work gives a very powerful active attack on the supersingular isogeny encryption scheme, and shows that the security of all schemes of this type depends on the difficulty of computing the endomorphism ring of asupersingular elliptic curve.
View via Publisher
Verifiable Delay Functions from Supersingular Isogenies and Pairings
TLDR
Two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography are presented and their practicality is demonstrated with a proof-of-concept implementation.
View via Publisher
On Polynomial Systems Arising from a Weil Descent
TLDR
This paper revisits a class of polynomial systems introduced by Faugere, Perret, Petit and Renault and conjecture that their degrees of regularity are only slightly larger than the original degrees of the equations, resulting in a very low complexity compared to generic systems.
View via Publisher
On the quaternion â„“-isogeny path problem
TLDR
A probabilistic algorithm which, for a given left $\mathcal{O}$ -ideal, computes a representative in its left ideal class of $\ell $ -power norm, which solves the underlying problem for a quaternion analog of the Charles–Goren–Lauter hash function, and has security implications for the original CGL construction in terms of supersingular elliptic curves.
View PDF on arXiv
Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
TLDR
Two signature schemes whose security relies on computational assumptions relating to isogeny graphs of supersingular elliptic curves are presented, both of them based on interactive identification protocols that lead to signatures that are existentially unforgeable under chosen message attacks.
View on Springer
Faster Algorithms for Isogeny Problems Using Torsion Point Images
  • C. Petit
  • Computer Science, Mathematics
    ASIACRYPT
  • 3 December 2017
There is a recent trend in cryptography to construct protocols based on the hardness of computing isogenies between supersingular elliptic curves. Two prominent examples are Jao-De Feo’s key exchange…
View via Publisher
A block cipher based pseudo random number generator secure against side-channel key recovery
TLDR
This work believes this work provides a first interesting example of the way the algorithmic design of a cryptographic scheme influences its side-channel resistance.
View on ACM
SQISign: compact post-quantum signatures from quaternions and isogenies
TLDR
A new signature scheme, SQISign, (for Short Quaternion and Isogeny Signature) from isogeny graphs of supersingular elliptic curves of known endomorphism rings is introduced, and it is proved that the resulting identification protocol is zero-knowledge.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License