Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
From MaRDI portal
Publication:5418715
DOI10.1007/978-3-642-55220-5_30zbMath1327.94035OpenAlexW2113717903MaRDI QIDQ5418715
Craig Gentry, Shai Halevi, Dhinakaran Vinayagamurthy, Valeria Nikolaenko, Sergey Gorbunov, Vinod Vaikuntanathan, Gil Segev, Dan Boneh
Publication date: 27 May 2014
Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_30
Related Items (only showing first 100 items - show all)
Attribute-Based Keyword Search from Lattices ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Constraining and Watermarking PRFs from Milder Assumptions ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Limits on the adaptive security of Yao's garbling ⋮ Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Adaptive Security of Yao’s Garbled Circuits ⋮ Predicate Encryption for Circuits from LWE ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Targeted Homomorphic Attribute-Based Encryption ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Attribute-based conditional proxy re-encryption in the standard model under LWE ⋮ Lattice-based HRA-secure attribute-based proxy re-encryption in standard model ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Attribute-based proxy re-encryption from standard lattices ⋮ From cryptomania to obfustopia through secret-key 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 ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Efficient and fully secure lattice-based IBE with equality test ⋮ Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups ⋮ New ways to garble arithmetic circuits ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Multi-key Homomorphic Authenticators ⋮ Verifiable Functional Encryption ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Functional encryption for computational hiding in prime order groups via pair encodings ⋮ Adaptively secure inner product encryption from LWE ⋮ Succinct and adaptively secure ABE for ABP from \(k\)-Lin ⋮ Inner-product functional encryption with fine-grained access control ⋮ 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-authority ABE for \(\mathsf{NC}^1\) from BDH ⋮ Multi-party functional encryption ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ On treewidth, separators and Yao's garbling ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ Ciphertext-policy attribute-based encryption for general circuits from bilinear maps ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Improved inner-product encryption with adaptive security and full attribute-hiding ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Compact (Targeted Homomorphic) Inner Product Encryption from LWE ⋮ Compact Inner Product Encryption from LWE ⋮ Function-private functional encryption in the private-key setting ⋮ On the complexity of compressing obfuscation ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Functional encryption for cascade automata ⋮ Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption ⋮ Functional Encryption for Turing Machines ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Provably Secure (Broadcast) Homomorphic Signcryption ⋮ Algebraic Attacks Against Several Weak Variants of GVW’13 ABE ⋮ Functional Encryption for Cascade Automata (Extended Abstract) ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Revocable attribute-based proxy re-encryption ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Optimal broadcast encryption from pairings and LWE ⋮ Impossibility results for lattice-based functional encryption schemes ⋮ Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) ⋮ Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ Turing Machines with Shortcuts: Efficient Attribute-Based Encryption for Bounded Functions ⋮ FHE Circuit Privacy Almost for Free ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
This page was built for publication: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
