Rate-1 zero-knowledge proofs from one-way functions
From MaRDI portal
Cites work
- A hierarchy theorem for interactive proofs of proximity
- A Pseudorandom Generator from any One-way Function
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Bit commitment using pseudorandomness
- Constant-round interactive proofs for delegating computation
- Delegating computation: interactive proofs for muggles
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Foundations of Cryptography
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 845842 (Why is no real title available?)
- Interactive PCP
- Local proofs approaching the witness length (extended abstract)
- Must you know the code of f to securely compute f?
- Obfuscation of probabilistic circuits and applications
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- Scalable Secure Multiparty Computation
- SoK: learning with errors, circular security, and fully homomorphic encryption
- Succinct interactive oracle proofs: applications and limitations
- The Knowledge Complexity of Interactive Proof Systems
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Zero-knowledge proofs from secure multiparty computation
This page was built for publication: Rate-1 zero-knowledge proofs from one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955037)
