![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
135 Result(s)
-
Living Reference Work Entry In depth
Blum–Goldwasser Public Key Encryption System
-
Chapter and Conference Paper
Cryptoeconomic Security for Data Availability Committees
Layer 2 systems have received increasing attention due to their potential to scale the throughput of L1 blockchains. To avoid the cost of putting data on chain, these systems increasingly turn to off-chain dat...
-
Chapter and Conference Paper
Powers-of-Tau to the People: Decentralizing Setup Ceremonies
We propose several decentralized ceremonies for constructing a powers-of-tau structured reference string (SRS). Our protocols make use of a blockchain platform to run in a permissionless manner, where anyone c...
-
Chapter and Conference Paper
Arithmetic Sketching
This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication zero-knowledge verification of secret-shared vectors. An arithme...
-
Chapter and Conference Paper
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates
Plonk is a widely used succinct non-interactive proof system that uses univariate polynomial commitments. Plonk is quite flexible: it supports circuits with low-degree “custom” gates as well as circuits with ...
-
Chapter and Conference Paper
A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies
We give the first black box lower bound for signature protocols that can be described as group actions, which include many based on isogenies. We show that, for a large class of signature schemes making black ...
-
Chapter and Conference Paper
Threshold Signatures with Private Accountability
Existing threshold signature schemes come in two flavors: (i) fully private, where the signature reveals nothing about the set of signers that generated the signature, and (ii) accountable, where the signature co...
-
Chapter and Conference Paper
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments
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 and prove its evaluation ...
-
Chapter and Conference Paper
An Airdrop that Preserves Recipient Privacy
A common approach to bootstrap** a new cryptocurrency is an airdrop, an arrangement in which existing users give away currency to entice new users to join. But current airdrops offer no recipient privacy: they ...
-
Chapter and Conference Paper
Oblivious Pseudorandom Functions from Isogenies
An oblivious PRF, or OPRF, is a protocol between a client and a server, where the server has a key k for a secure pseudorandom function F, and the client has an input x for the function. At the end of the protoco...
-
Chapter and Conference Paper
Zether: Towards Privacy in a Smart Contract World
Smart contract platforms such as Ethereum and Libra provide ways to seamlessly remove trust and add transparency to various distributed applications. Yet, these platforms lack mechanisms to guarantee user priv...
-
Chapter and Conference Paper
Improving Speed and Security in Updatable Encryption Schemes
Periodic key rotation is a common practice designed to limit the long-term power of cryptographic keys. Key rotation refers to the process of re-encrypting encrypted content under a fresh key, and overwriting ...
-
Chapter and Conference Paper
Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security
Recently Gennaro et al. (ACNS ’16) presented a threshold-optimal si...
-
Chapter and Conference Paper
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains
We present batching techniques for cryptographic accumulators and vector commitments ...
-
Chapter and Conference Paper
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the input and a pr...
-
Chapter and Conference Paper
Post-quantum EPID Signatures from Symmetric Primitives
EPID signatures are used extensively in real-world systems for hardware enclave attestation. As such, there is a strong interest in making these schemes post-quantum secure. In this paper we initiate the study...
-
Chapter and Conference Paper
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
Succinct non-interactive arguments (SNARGs) enable verifying \(\mathsf {NP} \) computations with significan...
-
Chapter and Conference Paper
Exploring Crypto Dark Matter:
Pseudorandom functions (PRFs) are one of the fundamental building blocks in cryptography. Traditionally, there have been two main approaches for PRF design: the “practitioner’s approach” of building concretely...
-
Chapter and Conference Paper
Threshold Cryptosystems from Threshold Fully Homomorphic Encryption
We develop a general approach to adding a threshold functionality to a large class of (non-threshold) cryptographic schemes. A threshold functionality enables a secret key to be split into a number of shares, ...
-
Chapter and Conference Paper
Verifiable Delay Functions
We study the problem of building a verifiable delay function (VDF). A \(\text {VDF}\) ...