Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > SUCCINCT ARGUMENTS:
Reports tagged with succinct arguments:
TR17-099 | 5th June 2017
Nir Bitansky, Omer Paneth, Yael Tauman Kalai

#### Multi-Collision Resistance: A Paradigm for Keyless Hash Functions

Revisions: 2

We study multi-collision-resistant hash functions --- a natural relaxation of collision-resistant hashing that only guarantees the intractability of finding many (rather than two) inputs that map to the same image. An appealing feature of such hash functions is that unlike their collision-resistant counterparts, they do not necessarily require a key. ... more >>>

TR21-038 | 15th March 2021
Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

#### Post-Quantum Succinct Arguments

Revisions: 1

We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness of Learning with Errors).

At the heart of our proof is a new ... more >>>

TR21-084 | 21st June 2021
Liron Bronfman, Ron Rothblum

#### PCPs and Instance Compression from a Cryptographic Lens

Modern cryptography fundamentally relies on the assumption that the adversary trying to break the scheme is computationally bounded. This assumption lets us construct cryptographic protocols and primitives that are known to be impossible otherwise. In this work we explore the effect of bounding the adversary's power in other information theoretic ... more >>>

TR21-180 | 21st December 2021
Noga Ron-Zewi, Ron Rothblum

#### Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead

Succinct arguments are proof systems that allow a powerful, but untrusted, prover to convince a weak verifier that an input $x$ belongs to a language $L \in NP$, with communication that is much shorter than the $NP$ witness. Such arguments, which grew out of the theory literature, are now drawing ... more >>>

ISSN 1433-8092 | Imprint