Reusable garbled circuits and succinct functional encryption
From MaRDI portal
Publication:5495826
DOI10.1145/2488608.2488678zbMath1293.68108OpenAlexW2161508639MaRDI QIDQ5495826
Nickolai Zeldovich, Raluca Ada Popa, Vinod Vaikuntanathan, Yael Kalai, Shafi Goldwasser
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/91245
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (only showing first 100 items - show all)
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Deniable fully homomorphic encryption from learning with errors ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ CCA secure \textit{a posteriori} openable encryption in the standard model ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) ⋮ Unclonable polymers and their cryptographic applications ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ On the power of rewinding simulators in functional encryption ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Proofs of Work from worst-case assumptions ⋮ Obfuscated fuzzy Hamming distance and conjunctions from subset product problems ⋮ Optimal bounded-collusion secure functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ A survey of lattice based expressive attribute based encryption ⋮ Multi-input Functional Encryption with Unbounded-Message Security ⋮ Verifiable Functional Encryption ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ Lighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryption ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Fully-secure MPC with minimal trust ⋮ Collusion-resistant functional encryption for RAMs ⋮ Public-key watermarking schemes for pseudorandom functions ⋮ Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits ⋮ A survey on functional encryption ⋮ Efficient lattice-based inner-product functional encryption ⋮ Practical multi-party quantum homomorphic encryption ⋮ Access control encryption with efficient verifiable sanitized decryption ⋮ Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions ⋮ Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Partitioned searchable encryption ⋮ Decentralized multi-client functional encryption for inner product ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Achieving IND-CCA Security for Functional Encryption for Inner Products ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Functional encryption for cubic polynomials and implementation ⋮ Functional encryption for randomized functionalities in the private-key setting from minimal assumptions ⋮ Function-private functional encryption in the private-key setting ⋮ Strongly full-hiding inner product encryption ⋮ Self-updatable encryption: time constrained access control with hidden attributes and better efficiency ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ On the complexity of compressing obfuscation ⋮ Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Cryptography with Updates ⋮ Functional encryption for cascade automata ⋮ Candidate iO from homomorphic encryption schemes ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Simple and generic constructions of succinct functional encryption ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Obfustopia built on secret-key functional encryption ⋮ Multi-input Functional Encryption and Its Application in Outsourcing Computation ⋮ Constrained pseudorandom functions from functional encryption ⋮ Functional Encryption for Cascade Automata (Extended Abstract) ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Candidate iO from homomorphic encryption schemes ⋮ Combiners for functional encryption, unconditionally ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Tightly CCA-secure inner product functional encryption scheme ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Unbounded multi-party computation from learning with errors ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Multi-client functional encryption for separable functions ⋮ Network Oblivious Transfer ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ A new approach to practical function-private inner product encryption ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Succinct non-interactive secure computation ⋮ Streaming functional encryption
This page was built for publication: Reusable garbled circuits and succinct functional encryption