Adaptive distributional security for garbling schemes with O(|x|) online complexity

DOI10.1007/978-981-99-8721-4_5zbMATH Open1546.9405MaRDI QIDQ6595677FDOQ6595677

Authors: Estuardo Alpirez Bock, Chris Brzuska, Pihla Karanko, Sabine Oechsner, Kirthivaasan Puniamurthy 

Publication date: 30 August 2024

zbMATH Keywords

fully homomorphic encryptioncommunication complexitysecure function evaluationindistinguishability obfuscation

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60) Analytic circuit theory (94C05)

Cites Work

• A Pseudorandom Generator from any One-way Function
• Title not available (Why is that?)
• Cryptography in constant parallel time
• Compression of samplable sources
• A proof of security of Yao's protocol for two-party computation
• Computational analogues of entropy
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Candidate one-way functions based on expander graphs
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Title not available (Why is that?)
• Deterministic and Efficiently Searchable Encryption
• Functional Encryption for Turing Machines
• Adaptively secure threshold symmetric-key encryption
• Adaptively secure garbling with near optimal online complexity
• Adaptively indistinguishable garbled circuits
• Adaptive security of practical garbling schemes
• Adaptively secure garbled circuits from one-way functions
• Obfuscation of probabilistic circuits and applications
• On treewidth, separators and Yao's garbling
• Instantiating random oracles via UCEs
• A uniform-complexity treatment of encryption and zero-knowledge
• Distinguisher-dependent simulation in two rounds and its applications
• Key homomorphic PRFs and their applications
• On the communication complexity of secure function evaluation with long output
• Adaptive security of Yao's garbled circuits
• State separation for code-based game-playing proofs
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Balancing bounded treewidth circuits
• Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• ParaDiSE: efficient threshold authenticated encryption in fully malicious model
• Incompressiblity and next-block pseudoentropy

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)