Predictable arguments of knowledge
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4211487 (Why is no real title available?)
- scientific article; zbMATH DE number 5485477 (Why is no real title available?)
- A parallel repetition theorem for any interactive argument
- A tamper and leakage resilient von Neumann architecture
- Advances in Cryptology – CRYPTO 2004
- An efficient parallel repetition theorem
- Definitions and properties of zero-knowledge proof systems
- Efficient chosen-ciphertext security via extractable hash proofs
- Foundations of Cryptography
- Fully Leakage-Resilient Codes
- Fully leakage-resilient signatures
- Functional signatures and pseudorandom functions
- How to avoid obfuscation using witness PRFs
- How to run Turing machines on encrypted data
- Leakage-Tolerant Interactive Protocols
- Mind your coins: fully leakage-resilient signatures with graceful degradation
- New negative results on differing-inputs obfuscation
- New techniques for SPHFs and efficient one-round PAKE protocols
- Offline witness encryption
- On interactive proofs with a laconic prover
- On the (im)possibility of obfuscating programs
- On the complexity of interactive proofs with bounded communication
- On the connection between leakage tolerance and adaptive security
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- Parallel repetition of computationally sound protocols revisited
- Parallel repetition theorems for interactive arguments
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Predictable arguments of knowledge
- Programmable Hash Functions and Their Applications
- Resettable statistical zero knowledge
- Rethinking privacy for extended sanitizable signatures and a black-box construction of strongly private schemes
- Signatures resilient to continual leakage on memory and computation
- Theory of Cryptography
- Tight parallel repetition theorems for public-coin arguments using KL-divergence
- Witness encryption and its applications
- Zaps and Their Applications
- Zero knowledge in the random oracle model, revisited
Cited in
(16)- Towards witness encryption without multilinear maps
- Offline witness encryption with semi-adaptive security
- Witness encryption from smooth projective hashing system
- Explainable arguments
- Succinct witness encryption for batch languages and applications
- How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
- Predictable arguments of knowledge
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- On witness encryption and laconic zero-knowledge arguments
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Witness maps and applications
- Fully Leakage-Resilient Codes
- Resettable statistical zero-knowledge for NP
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- (Commit-and-prove) predictable arguments with privacy
This page was built for publication: Predictable arguments of knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738785)
