Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments
D Boneh, J Drake, B Fisch, A Gabizon - … 2021, Virtual Event, August 16–20 …, 2021 - Springer
Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …
Practical non-interactive publicly verifiable secret sharing with thousands of parties
Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-) sharing of
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …
Traceability in permissioned blockchain
T Mitani, A Otsuka - IEEE Access, 2020 - ieeexplore.ieee.org
In this paper, we have achieved privacy protection and high transparency in a permissioned
blockchain. There is a sidechain that connects the permissionless blockchain and the …
blockchain. There is a sidechain that connects the permissionless blockchain and the …
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
We propose the first zero-knowledge argument with sub-linear communication complexity
for arithmetic circuit satisfiability over a prime p whose security is based on the hardness of …
for arithmetic circuit satisfiability over a prime p whose security is based on the hardness of …
Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
In this work we present a new interactive Zero-Knowledge Argument of knowledge for
general arithmetic circuits. Our protocol is based on the “MPC-in-the-head”-paradigm of …
general arithmetic circuits. Our protocol is based on the “MPC-in-the-head”-paradigm of …
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
We propose (honest verifier) zero-knowledge arguments for the modular subset sum
problem. Previous combinatorial approaches, notably one due to Shamir, yield arguments …
problem. Previous combinatorial approaches, notably one due to Shamir, yield arguments …
Halo infinite: Recursive zk-snarks from any additive polynomial commitment scheme
D Boneh, J Drake, B Fisch, A Gabizon - Cryptology ePrint Archive, 2020 - eprint.iacr.org
Polynomial commitment schemes (PCS) have recently been in the spotlight for their key role
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …
in building SNARKs. A PCS provides the ability to commit to a polynomial over a finite field …
Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
Abstract The HighGear protocol (Eurocrypt 2018) is the fastest currently known approach to
preprocessing for the SPDZ Multi-Party Computation scheme. Its backbone is formed by an …
preprocessing for the SPDZ Multi-Party Computation scheme. Its backbone is formed by an …
One-shot verifiable encryption from lattices
Verifiable encryption allows one to prove properties about encrypted data and is an
important building block in the design of cryptographic protocols, eg, group signatures, key …
important building block in the design of cryptographic protocols, eg, group signatures, key …
Practical quantum-safe voting from lattices
We propose a lattice-based electronic voting scheme, EVOLVE (Electronic Voting from
Lattices with Verification), which is conjectured to resist attacks by quantum computers. Our …
Lattices with Verification), which is conjectured to resist attacks by quantum computers. Our …