Identity-based encryption secure against selective opening attack

Authors:
Mihir Bellare;Brent Waters;Scott Yilek
Affiliations:
Department of Computer Science and Engineering, University of California San Diego, La Jolla, CA;Department of Computer Science, University of Texas at Austin, Austin TX;Department of Computer and Information Sciences, University of St. Thomas, St. Paul, MN
Venue:
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Year:
2011

Citing 26
Cited 14

Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Deniable Encryption

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues

Proceedings of the 8th IMA International Conference on Cryptography and Coding
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998

Journal of the ACM (JACM)
Short Signatures from the Weil Pairing

Journal of Cryptology
Chosen-Ciphertext Security from Identity-Based Encryption

SIAM Journal on Computing
Lossy trapdoor functions and their applications

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Framework for Efficient and Composable Oblivious Transfer

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
A forward-secure public-key encryption scheme

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptography and game theory: designing protocols for exchanging information

TCC'08 Proceedings of the 5th conference on Theory of cryptography
New techniques for dual system encryption and fully secure HIBE with short ciphertexts

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Adaptively-secure, non-interactive public-key encryption

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Encryption schemes secure against chosen-ciphertext selective opening attacks

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Bonsai trees, or how to delegate a lattice basis

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Anonymous hierarchical identity-based encryption (without random oracles)

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The security of triple encryption and a framework for code-based game-playing proofs

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Achieving leakage resilience through dual system encryption

TCC'11 Proceedings of the 8th conference on Theory of cryptography
How to leak on key updates

Proceedings of the forty-third annual ACM symposium on Theory of computing
Unbounded HIBE and attribute-based encryption

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Decentralizing attribute-based encryption

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Verifiable delegation of computation over large datasets

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Lossy encryption: constructions from general assumptions and efficient selective opening chosen ciphertext security

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Tools for simulating features of composite order bilinear groups in the prime order setting

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Adaptively attribute-hiding (hierarchical) inner product encryption

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Standard security does not imply security against selective-opening

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Homomorphic encryption for multiplications and pairing evaluation

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Dual form signatures: an approach for proving security from static assumptions

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Fully secure unbounded inner-product and attribute-based encryption

ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Leakage resilient IBE and IPE under the DLIN assumption

ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
The relation and transformation between hierarchical inner product encryption and spatial encryption

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first IBE schemes that are proven secure against selective opening attack (SOA). This means that if an adversary, given a vector of ciphertexts, adaptively corrupts some fraction of the senders, exposing not only their messages but also their coins, the privacy of the unopened messages is guaranteed. Achieving security against such attacks is well-known to be challenging and was only recently done in the PKE case. We show that IBE schemes having a property we call 1-sided public openability (1SPO) yield SOA secure IBE schemes and then provide two 1SPO IBE schemes, the first based on the Boyen-Waters anonymous IBE and the second on Waters' dual-system approach.