VSS from distributed ZK proofs and applications
Abstract Non-Interactive Verifiable Secret Sharing (NI-VSS) is a technique for distributing a
secret among a group of individuals in a verifiable manner, such that shareholders can verify …
secret among a group of individuals in a verifiable manner, such that shareholders can verify …
CSI-SharK: CSI-FiSh with sharing-friendly keys
CSI-FiSh is one of the most efficient isogeny-based signature schemes, which is proven to
be secure in the Quantum Random Oracle Model (QROM). However, there is a bottleneck in …
be secure in the Quantum Random Oracle Model (QROM). However, there is a bottleneck in …
Cutting the grass: threshold group action signature schemes
Group actions are fundamental mathematical tools, with a long history of use in
cryptography. Indeed, the action of finite groups at the basis of the discrete logarithm …
cryptography. Indeed, the action of finite groups at the basis of the discrete logarithm …
Round-Robin is Optimal: Lower Bounds for Group Action Based Protocols
An hard homogeneous space (HHS) is a finite group acting on a set with the group action
being hard to invert and the set lacking any algebraic structure. As such HHS could …
being hard to invert and the set lacking any algebraic structure. As such HHS could …
Practical robust DKG protocols for CSIDH
Abstract A Distributed Key Generation (DKG) protocol is an essential component of
threshold cryptography. DKGs enable a group of parties to generate a secret and public key …
threshold cryptography. DKGs enable a group of parties to generate a secret and public key …
New Proof Systems and an OPRF from CSIDH
Isogeny computations in CSIDH (Asiacrypt 2018) are described using a commutative group
G acting on the set of supersingular elliptic curves. The commutativity property gives CSIDH …
G acting on the set of supersingular elliptic curves. The commutativity property gives CSIDH …
An isogeny-based ID protocol using structured public keys
Isogeny-based cryptography is known as one of the promising approaches to the emerging
post-quantum public key cryptography. In cryptography, an IDentification (ID) protocol is a …
post-quantum public key cryptography. In cryptography, an IDentification (ID) protocol is a …
Faster proofs and VRFs from isogenies
We improve recent generic proof systems for isogeny knowledge by Cong, Lai, Levin [26]
based on circuit satisfiability, by using radical isogeny descriptions [19, 20] to prove a path in …
based on circuit satisfiability, by using radical isogeny descriptions [19, 20] to prove a path in …
On actively secure fine-grained access structures from isogeny assumptions
F Campos, P Muth - International Conference on Post-Quantum …, 2022 - Springer
We present an actively secure threshold scheme in the setting of Hard Homogeneous
Spaces (HHS) which allows fine-grained access structures. More precisely, we elevate a …
Spaces (HHS) which allows fine-grained access structures. More precisely, we elevate a …
[PDF][PDF] Lattice Isomorphism as a Group Action and Hard Problems on Quadratic Forms.
Group actions have been used as a foundation in Public-key Cryptography to provide a
framework for hard problems and assumptions. In this work we formalize the Lattice …
framework for hard problems and assumptions. In this work we formalize the Lattice …