Adaptive distributional security for garbling schemes with O(|x|) online complexity
From MaRDI portal
Publication:6595677
Recommendations
Cites work
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A proof of security of Yao's protocol for two-party computation
- A uniform-complexity treatment of encryption and zero-knowledge
- Adaptive security of Yao's garbled circuits
- Adaptive security of practical garbling schemes
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Adaptively indistinguishable garbled circuits
- Adaptively secure garbled circuits from one-way functions
- Adaptively secure garbling with near optimal online complexity
- Adaptively secure threshold symmetric-key encryption
- Balancing bounded treewidth circuits
- Candidate one-way functions based on expander graphs
- Compression of samplable sources
- Computational analogues of entropy
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Cryptography in constant parallel time
- Deterministic and Efficiently Searchable Encryption
- Distinguisher-dependent simulation in two rounds and its applications
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Functional Encryption for Turing Machines
- Incompressiblity and next-block pseudoentropy
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Instantiating random oracles via UCEs
- Key homomorphic PRFs and their applications
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Obfuscation of probabilistic circuits and applications
- On the communication complexity of secure function evaluation with long output
- On treewidth, separators and Yao's garbling
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- State separation for code-based game-playing proofs
This page was built for publication: Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595677)
