Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
type: Item
instance of: scholarly article
title: Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
zbMATH Open document ID: 1546.9405
DOI: 10.1007/978-981-99-8721-4_5
author: Estuardo Alpirez Bock
author: Chris Brzuska
author: Pihla Karanko
author: Sabine Oechsner
author: Kirthivaasan Puniamurthy
publication date: 2024-08-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 7903880
zbMATH Keywords: communication complexity
zbMATH Keywords: fully homomorphic encryption
zbMATH Keywords: indistinguishability obfuscation
zbMATH Keywords: secure function evaluation
MaRDI profile type: Publication
cites work: ParaDiSE: efficient threshold authenticated encryption in fully malicious model
cites work: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
cites work: Functional Encryption for Turing Machines
cites work: Cryptography in constant parallel time
cites work: Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Deterministic and Efficiently Searchable Encryption
cites work: Instantiating Random Oracles via UCEs
cites work: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
cites work: Q4434895
cites work: Q3795218
cites work: Key Homomorphic PRFs and Their Applications
cites work: State separation for code-based game-playing proofs
cites work: Obfuscation of Probabilistic Circuits and Applications
cites work: Adaptively secure garbling with near optimal online complexity
cites work: A uniform-complexity treatment of encryption and zero-knowledge
cites work: Candidate One-Way Functions Based on Expander Graphs
cites work: Incompressiblity and next-block pseudoentropy
cites work: A Pseudorandom Generator from any One-way Function
cites work: Adaptively Secure Garbled Circuits from One-Way Functions
cites work: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
cites work: On the Communication Complexity of Secure Function Evaluation with Long Output
cites work: Adaptive security of practical garbling schemes
cites work: Adaptively indistinguishable garbled circuits
cites work: Adaptive Security of Yao’s Garbled Circuits
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: Balancing bounded treewidth circuits
cites work: On treewidth, separators and Yao's garbling
cites work: Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
cites work: A proof of security of Yao's protocol for two-party computation
cites work: Adaptively secure threshold symmetric-key encryption
cites work: Compression of samplable sources
description: scientific article; zbMATH DE number 7903880