Andrea Cerulli
Artificial Intelligence · 2016–2017
A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 24 citations into it
Whom Andrea Cerulli trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrea Cerulli overall
Papers from Andrea Cerulli's perspective
Ordered by how strongly the researchers Andrea Cerulli trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- On interactive proofs with a laconic prover
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Efficient signature generation by smart cards
- Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
- On the Complexity of Interactive Proofs with Bounded Communication
Their papers
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016) — 413 citations
- Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability (2017) — 82 citations