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 EncryptionDeniable fully homomorphic encryption from learning with errorsImpossibility of simulation secure functional encryption even with random oraclesSuccinct garbling schemes from functional encryption through a local simulation paradigmFunctional encryption for Turing machines with dynamic bounded collusion from LWEDeniable Attribute Based Encryption for Branching Programs from LWEFrom Cryptomania to Obfustopia Through Secret-Key Functional EncryptionSingle-Key to Multi-Key Functional Encryption with Polynomial LossCompactness vs Collusion Resistance in Functional EncryptionAdaptive-secure identity-based inner-product functional encryption and its leakage-resilienceCCA secure \textit{a posteriori} openable encryption in the standard modelAdaptively 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 applicationsIndistinguishability Obfuscation for RAM Programs and Succinct Randomized EncodingsToward non-interactive zero-knowledge proofs for NP from LWEOn the power of rewinding simulators in functional encryptionFrom cryptomania to obfustopia through secret-key functional encryptionFrom minicrypt to obfustopia via private-key functional encryptionProofs of Work from worst-case assumptionsObfuscated fuzzy Hamming distance and conjunctions from subset product problemsOptimal bounded-collusion secure functional encryptionFrom FE combiners to secure MPC and backAttribute based encryption for deterministic finite automata from DLINA survey of lattice based expressive attribute based encryptionMulti-input Functional Encryption with Unbounded-Message SecurityVerifiable Functional EncryptionEncoding Functions with Constant Online Rate, or How to Compress Garbled Circuit KeysWhite-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation(Compact) adaptively secure FE for attribute-weighted sums from \(k\)-linUnbounded predicate inner product functional encryption from pairingsLighter is better: a lighter multi-client verifiable outsourced computation with hybrid homomorphic encryptionBounded functional encryption for Turing machines: adaptive security from general assumptionsFully-secure MPC with minimal trustCollusion-resistant functional encryption for RAMsPublic-key watermarking schemes for pseudorandom functionsLeakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled CircuitsA survey on functional encryptionEfficient lattice-based inner-product functional encryptionPractical multi-party quantum homomorphic encryptionAccess control encryption with efficient verifiable sanitized decryptionCollusion resistant trace-and-revoke for arbitrary identities from standard assumptionsSuccinct multi-authority attribute-based access control for circuits with authenticated outsourcingDecentralized multi-client functional encryption for set intersection with improved efficiencyPartitioned searchable encryptionDecentralized multi-client functional encryption for inner productPractical fully secure unrestricted inner product functional encryption modulo \(p\)Achieving IND-CCA Security for Functional Encryption for Inner ProductsCollusion Resistant Traitor Tracing from Learning with ErrorsQuantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharingEfficient Inner Product Encryption with Simulation-Based SecurityBi-homomorphic Lattice-Based PRFs and Unidirectional Updatable EncryptionExtremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verificationPractical Order-Revealing Encryption with Limited LeakageFunctional encryption for cubic polynomials and implementationFunctional encryption for randomized functionalities in the private-key setting from minimal assumptionsFunction-private functional encryption in the private-key settingStrongly full-hiding inner product encryptionSelf-updatable encryption: time constrained access control with hidden attributes and better efficiencyMulti-input functional encryption in the private-key setting: stronger security from weaker assumptionsOn the complexity of compressing obfuscationBounded-Collusion Attribute-Based Encryption from Minimal AssumptionsFrom Minicrypt to Obfustopia via Private-Key Functional EncryptionConstraint-Hiding Constrained PRFs for NC $$^1$$ from LWEMulti-input Inner-Product Functional Encryption from PairingsOn Removing Graded Encodings from Functional EncryptionFunctional Encryption: Deterministic to Randomized Functions from Simple AssumptionsCryptography with UpdatesFunctional encryption for cascade automataCandidate iO from homomorphic encryption schemesUniversally Verifiable Multiparty Computation from Threshold Homomorphic CryptosystemsSimple and generic constructions of succinct functional encryptionOutput-Compressing Randomized Encodings and ApplicationsFunctional Encryption for Turing MachinesObfustopia built on secret-key functional encryptionMulti-input Functional Encryption and Its Application in Outsourcing ComputationConstrained pseudorandom functions from functional encryptionFunctional Encryption for Cascade Automata (Extended Abstract)Candidate Indistinguishability Obfuscation and Functional Encryption for All CircuitsCandidate iO from homomorphic encryption schemesCombiners for functional encryption, unconditionallyCompact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)Tightly CCA-secure inner product functional encryption schemeNew lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertextsUnbounded multi-party computation from learning with errorsThreshold garbled circuits and ad hoc secure computationIndistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplificationCandidate obfuscation via oblivious LWE samplingTrinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable ComputationMulti-client functional encryption for separable functionsNetwork Oblivious TransferQuantum Homomorphic Encryption for Polynomial-Sized CircuitsAdaptively Secure Garbled Circuits from One-Way FunctionsFully Secure Functional Encryption for Inner Products, from Standard AssumptionsA new approach to practical function-private inner product encryptionAmplifying the security of functional encryption, unconditionallyUnnamed ItemGarbled Circuits as Randomized Encodings of Functions: a PrimerSuccinct non-interactive secure computationStreaming functional encryption




This page was built for publication: Reusable garbled circuits and succinct functional encryption