Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
From MaRDI portal
Publication:2874521
DOI10.1007/978-3-662-44371-2_27zbMath1310.94130OpenAlexW288529411MaRDI QIDQ2874521
Publication date: 7 August 2014
Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_27
indistinguishability obfuscationmultiparty key exchangeefficient broadcast encryptionefficient traitor tracing
Related Items (60)
One-Way Functions and (Im)perfect Obfuscation ⋮ Traceable secret sharing and applications ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ White box traitor tracing ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Separating Computational and Statistical Differential Privacy in the Client-Server Model ⋮ Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Secret-sharing for NP ⋮ Incompressible cryptography ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ New approaches to traitor tracing with embedded identities ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Traitor tracing with \(N^{1/3}\)-size ciphertexts and \(O(1)\)-size keys from \(k\)-Lin ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ How to Generate and Use Universal Samplers ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ Offline Assisted Group Key Exchange ⋮ On the worst-case inefficiency of CGKA ⋮ Adaptive multiparty NIKE ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Beyond software watermarking: traitor-tracing for pseudorandom functions ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Indistinguishability obfuscation ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ NIKE from affine determinant programs ⋮ One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Constraining Pseudorandom Functions Privately ⋮ Universal Samplers with Fast Verification ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Candidate iO from homomorphic encryption schemes ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Reconfigurable Cryptography: A Flexible Approach to Long-Term Security ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Functional Encryption Without Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Constrained pseudorandom functions from functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol ⋮ Leakage-resilient key exchange and two-seed extractors ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings ⋮ The Complexity of Differential Privacy ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
This page was built for publication: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
