Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs
We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …
A Compressed -Protocol Theory for Lattices
We show a lattice-based solution for commit-and-prove transparent circuit zero-knowledge
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
(ZK) with polylog-communication, the first not depending on PCPs. We start from …
Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
An accumulator is a function that hashes a set of inputs into a short, constant-size string
while preserving the ability to efficiently prove the inclusion of a specific input element in the …
while preserving the ability to efficiently prove the inclusion of a specific input element in the …
Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
We construct efficient ring signatures (RS) from isogeny and lattice assumptions. Our ring
signatures are based on a logarithmic OR proof for group actions. We instantiate this group …
signatures are based on a logarithmic OR proof for group actions. We instantiate this group …
Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices
Although they have been studied for a long time, distributed signature protocols have
garnered renewed interest in recent years in view of novel applications to topics like …
garnered renewed interest in recent years in view of novel applications to topics like …
More efficient commitments from structured lattice assumptions
We present a practical construction of an additively homomorphic commitment scheme
based on structured lattice assumptions, together with a zero-knowledge proof of opening …
based on structured lattice assumptions, together with a zero-knowledge proof of opening …
A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
R del Pino, S Katsumata - Annual International Cryptology Conference, 2022 - Springer
Blind signatures, proposed by Chaum (CRYPTO'82), are interactive protocols between a
signer and a user, where a user can obtain a signature without revealing the message to be …
signer and a user, where a user can obtain a signature without revealing the message to be …
Practical exact proofs from lattices: New techniques to exploit fully-splitting rings
We propose a very fast lattice-based zero-knowledge proof system for exactly proving
knowledge of a ternary solution ⃗ s ∈ {-1, 0, 1\}^ ns→∈-1, 0, 1 n to a linear equation A ⃗ s …
knowledge of a ternary solution ⃗ s ∈ {-1, 0, 1\}^ ns→∈-1, 0, 1 n to a linear equation A ⃗ s …
Signature schemes with efficient protocols and dynamic group signatures from lattice assumptions
A recent line of works–initiated by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010)–gave
lattice-based constructions allowing users to authenticate while remaining hidden in a …
lattice-based constructions allowing users to authenticate while remaining hidden in a …
Post-quantum era privacy protection for intelligent infrastructures
As we move into a new decade, the global world of Intelligent Infrastructure (II) services
integrated into the Internet of Things (IoT) are at the forefront of technological advancements …
integrated into the Internet of Things (IoT) are at the forefront of technological advancements …