Almost-Tight Identity Based Encryption Against Selective Opening Attack

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Computer/law journal

• Publication date

  2016-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1093/COMJNL/BXW030
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Selective opening security of practical public-key encryption schemes

  2016cited by this paper
• Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings

  2016cited by this paper
• A Study of Pair Encodings: Predicate Encryption in Prime Order Groups

  2016cited by this paper
• Extended Nested Dual System Groups, Revisited

  2016cited by this paper
• Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms

  2015cited by this paper
• Identity-Based Lossy Encryption from Learning with Errors

  2015cited by this paper
• A Framework for Identity-Based Encryption with Almost Tight Security

  2015cited by this paper
• Improved Dual System ABE in Prime-Order Groups via Predicate Encodings

  2015cited by this paper
• Dual System Encryption via Doubly Selective Security: Framework, Fully-secure Functional Encryption for Regular Languages, and More

  2014cited by this paper
• Identity-Based Encryption Secure Against Selective Opening Chosen-Ciphertext Attack

  2014cited by this paper
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication

  2014cited by this paper
• Dual System Encryption via Predicate Encodings

  2014cited by this paper
• Fully, (Almost) Tightly Secure IBE and Dual System Groups

  2013cited by this paper
• Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited

  2013cited by this paper
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces

  2013cited by this paper
• New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

  2012cited by this paper
• Variants of Waters' Dual-System Primitives Using Asymmetric Pairings

  2012cited by this paper
• Shorter IBE and Signatures via Asymmetric Pairings

  2012cited by this paper
• Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

  2012cited by this paper
• Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

  2012cited by this paper
• All-But-Many Lossy Trapdoor Functions

  2012cited by this paper
• Fully Secure Unbounded Inner-Product and Attribute-Based Encryption

  2012cited by this paper
• Unbounded HIBE and Attribute-Based Encryption

  2011cited by this paper
• Identity-Based Encryption Secure against Selective Opening Attack

  2011cited by this paper
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security

  2011cited by this paper
• Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption

  2010cited by this paper
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption

  2010cited by this paper
• Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts

  2010cited by this paper
• Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks

  2010cited by this paper
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts

  2010cited by this paper
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

  2009cited by this paper
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

  2009cited by this paper
• Practical Identity-Based Encryption Without Random Oracles

  2006cited by this paper
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

  2006cited by this paper
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)

  2006cited by this paper
• Evaluating 2-DNF Formulas on Ciphertexts

  2005cited by this paper
• Efficient Identity-Based Encryption Without Random Oracles

  2005cited by this paper
• Secure Identity Based Encryption Without Random Oracles

  2004cited by this paper
• Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles

  2004cited by this paper
• Short Signatures from the Weil Pairing

  2001cited by this paper
• An Identity Based Encryption Scheme Based on Quadratic Residues

  2001cited by this paper
• Identity-Based Encryption from the Weil Pairing

  2001cited by this paper
• Deniable Encryption

  1997cited by this paper
• Number-theoretic constructions of efficient pseudo-random functions

  1997cited by this paper
• Identity-Based Cryptosystems and Signature Schemes

  1984cited by this paper

• IBE with tight security against selective opening and chosen-ciphertext attacks

  2020cites this paper
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting

  2015cites this paper