Predictable Arguments of Knowledge
From MaRDI portal
Publication:5738785
DOI10.1007/978-3-662-54365-8_6zbMath1404.94067OpenAlexW2593883284MaRDI QIDQ5738785
Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11573/958560
Related Items
Witness Maps and Applications ⋮ Explainable arguments ⋮ Witness encryption from smooth projective hashing system ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Offline witness encryption with semi-adaptive security ⋮ Predictable Arguments of Knowledge ⋮ Fully Leakage-Resilient Codes ⋮ Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs ⋮ (Commit-and-prove) predictable arguments with privacy ⋮ Towards witness encryption without multilinear maps
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- Parallel repetition of computationally sound protocols revisited
- Definitions and properties of zero-knowledge proof systems
- On interactive proofs with a laconic prover
- Fully leakage-resilient signatures
- How to Avoid Obfuscation Using Witness PRFs
- Offline Witness Encryption
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- How to Run Turing Machines on Encrypted Data
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Leakage-Tolerant Interactive Protocols
- Resettable Statistical Zero Knowledge
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- A Tamper and Leakage Resilient von Neumann Architecture
- Signatures Resilient to Continual Leakage on Memory and Computation
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
- Rethinking Privacy for Extended Sanitizable Signatures and a Black-Box Construction of Strongly Private Schemes
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
- Programmable Hash Functions and Their Applications
- Zero Knowledge in the Random Oracle Model, Revisited
- Foundations of Cryptography
- On the Connection between Leakage Tolerance and Adaptive Security
- Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
- Advances in Cryptology – CRYPTO 2004
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- A Parallel Repetition Theorem for Any Interactive Argument
- Zaps and Their Applications
- Witness encryption and its applications
- Theory of Cryptography
- Predictable Arguments of Knowledge
- Fully Leakage-Resilient Codes
- New Negative Results on Differing-Inputs Obfuscation
