Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption

DOI10.1007/978-3-662-48000-7_24zbMath1369.94536OpenAlexW2295625064MaRDI QIDQ3457081

Romain Gay, Hoeteck Wee, Iordanis Kerenidis

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_24

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

Quadratic secret sharing and conditional disclosure of secrets ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin ⋮ Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Adaptive Oblivious Transfer and Generalization ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Inner-product functional encryption with fine-grained access control ⋮ Multi-party PSM, revisited: improved communication and unbalanced communication ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs ⋮ Unnamed Item ⋮ The communication complexity of private simultaneous messages, revisited ⋮ From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back ⋮ Déjà Q: Encore! Un Petit IBE ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Some Open Problems in Information-Theoretic Cryptography

Cites Work

• On the distributional complexity of disjointness
• Factoring numbers in O(log n) arithmetic steps
• On randomized one-round communication complexity
• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• Protecting data privacy in private information retrieval schemes
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
• Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
• New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
• The Hardness of Being Private
• Identity-Based Cryptosystems and Signature Schemes
• Unbounded HIBE and Attribute-Based Encryption
• Decentralizing Attribute-Based Encryption
• Secret-Sharing Schemes: A Survey
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
• Communication Complexity in Algebraic Two-Party Protocols
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• The Probabilistic Communication Complexity of Set Intersection
• Hierarchical ID-Based Cryptography
• Identity-Based Encryption from the Weil Pairing
• Fuzzy Identity-Based Encryption
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• On the Cryptographic Complexity of the Worst Functions
• Dual System Encryption via Predicate Encodings
• A Zero-One Law for Boolean Privacy

This page was built for publication: Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption