Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
type: Item
instance of: scholarly article
title: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
zbMATH Open document ID: 1405.94045
author: Dan Boneh
author: Mark Zhandry
published in: Algorithmica
publication date: 2018-01-05T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6822866
zbMATH Keywords: obfuscation
zbMATH Keywords: key exchange
zbMATH Keywords: traitor tracing
zbMATH Keywords: broadcast encryption
MaRDI profile type: Publication
OpenAlex ID: W2553934243
cites work: Privacy in Encrypted Content Distribution Using Private Broadcast Encryption
cites work: Q4783716
cites work: Functional Signatures and Pseudorandom Functions
cites work: Protecting Obfuscation against Algebraic Attacks
cites work: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Black-box obfuscation for d-CNFs
cites work: Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
cites work: Q4432349
cites work: Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
cites work: Constrained Pseudorandom Functions and Their Applications
cites work: Low Overhead Broadcast Encryption from Multilinear Maps
cites work: Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
cites work: Q4364570
cites work: Q4940701
cites work: Cryptanalysis of the Multilinear Map over the Integers
cites work: Cryptanalysis of GGH15 Multilinear Maps
cites work: Practical Multilinear Maps over the Integers
cites work: Q4542530
cites work: Public Traceability in Traitor Tracing Schemes
cites work: Obfuscation of Hyperplane Membership
cites work: Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
cites work: Public Key Broadcast Encryption for Stateless Receivers
cites work: Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack
cites work: Zaps and Their Applications
cites work: On the complexity of differentially private data release
cites work: Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys
cites work: Non-Interactive Key Exchange
cites work: Programmable Hash Functions in the Multilinear Setting
cites work: Q4341773
cites work: Outsider-Anonymous Broadcast Encryption with Sublinear Ciphertexts
cites work: Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
cites work: Candidate Multilinear Maps from Ideal Lattices
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Graph-Induced Multilinear Maps from Lattices
cites work: Q3729902
cites work: Witness encryption and its applications
cites work: Secure Obfuscation in a Weak Multilinear Map Model
cites work: Perfect Non-interactive Zero Knowledge for NP
cites work: Breaking the Sub-Exponential Barrier in Obfustopia
cites work: On Best-Possible Obfuscation
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
cites work: Cryptanalysis of GGH Map
cites work: How to Generate and Use Universal Samplers
cites work: Q4409109
cites work: Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
cites work: A one round protocol for tripartite Diffie-Hellman
cites work: One-Way Functions and (Im)perfect Obfuscation
cites work: Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
cites work: Separations in Circular Security for Arbitrary Length Key Cycles
cites work: Breaking and Repairing Asymmetric Public-Key Traitor Tracing
cites work: Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4783719
cites work: Q4536284
cites work: How to use indistinguishability obfuscation
cites work: Answering n {2+o(1)} counting queries with differential privacy is hard
cites work: On obfuscating point functions
cites work: Q2724458
cites work: How to Avoid Obfuscation Using Witness PRFs
DOI: 10.1007/S00453-016-0242-8