Forward Secure Asynchronous Messaging from Puncturable Encryption

  title={Forward Secure Asynchronous Messaging from Puncturable Encryption},
  author={Matthew Green and Ian Miers},
  journal={2015 IEEE Symposium on Security and Privacy},
  • M. Green, Ian Miers
  • Published 17 May 2015
  • Computer Science, Mathematics
  • 2015 IEEE Symposium on Security and Privacy
In this paper we investigate new mechanisms for achieving forward secure encryption in store and forward messaging systems such as email and SMS. In a forward secure encryption scheme, a user periodically updates her secret key so that past messages remain confidential in the event that her key is compromised. A primary contribution of our work is to introduce a new form of encryption that we name puncturable encryption. Using a puncturable encryption scheme, recipients may repeatedly update… 

Figures and Tables from this paper

Puncturable Proxy Re-Encryption Supporting to Group Messaging Service
A forward secure PPRE in the group messaging service is presented, inspired by unidirectional proxy re-encryption (UPRE), which achieves forward secrecy through fine-grained revocation of decryption capability by integrating the PE scheme.
A Generic Construction of Puncturable Encryption
  • Mingyuan XiaLingyuan Yin
  • Computer Science, Mathematics
    2019 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)
  • 2019
This paper presents a generic construction that converts any existing chosen-ciphertext secure identity-based encryption scheme into a puncturable encryption scheme, and presents an instantiation of the proposed generic construction.
Hierarchical Identity-based Puncturable Encryption from Lattices with Application to Forward Security
A new primitive called hierarchical identity-based puncturable encryption (HIBPE) is introduced that enhances the concept of PE by allowing more general key delegation and flexible key puncture and provides quantum-safe protection for secret keys from exposure in multi-level encrypted data sharing by evolving the keys with time.
Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption
This paper introduces a new form of symmetric encryption, named symmetric puncturable encryption (SPE), and construct a generic primitive from simple cryptographic tools, and presents a backward-secure SSE scheme that can revoke a server's searching ability on deleted data.
Puncturable Encryption: A Generic Construction from Delegatable Fully Key-Homomorphic Encryption
Basing on the framework, the first post-quantum secure PE instantiation that is based on the learning with errors problem, selective secure under chosen plaintext attacks (CPA) in the standard model is obtained.
Fine-Grained Forward Secrecy: Allow-List/Deny-List Encryption and Applications
DFPE significantly enhances and generalizes previous variants of PE by allowing an interleaved application of allowand deny-list operations, and presents a construction of DFPE in prime-order bilinear groups.
Key Agreement for Decentralized Secure Group Messaging with Strong Security Guarantees
This paper defines decentralized continuous group key agreement (DCGKA), a new cryptographic primitive encompassing the core of a decentralized secure group messaging protocol, and gives a practical construction of a DCGKA protocol and proves its security; and describes how to construct a full messaging protocol from DCGka.
Forward Secure Delay-Tolerant Networking ∗ Signe Rüsch
This work applies the Puncturable Encryption construction designed by Green and Miers, integrates it into the Bundle Security Protocol and adapt its parameters for different highly asynchronous scenarios, and proposes the first forward secure protocol for Delay-Tolerant Networking.
Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange
Bloom filter encryption (BFE), which is derived from the probabilistic Bloom filter data structure, is introduced and different constructions of BFE schemes are described and it is shown how these yield new puncturable encryption mechanisms with extremely efficient puncturing.
Public-Key Puncturable Encryption: Modular and Compact Constructions
A generic construction of puncturable key encapsulation mechanism from the former by merging the idea of distributed key-distribution and revocable encryption is proposed, which gets a comparable scheme proven secure under the standard DBDH assumption, which enjoys both faster encryption and decryption than previous works based on the same assumption.


Hierarchical Identity Based Encryption with Constant Size Ciphertext
A Hierarchical Identity Based Encryption system where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, regardless of the hierarchy depth, which is proved to be as efficient as in other HIBE systems.
Secure E-mail protocols providing perfect forward secrecy
Two new E-mail protocols providing perfect forward secrecy are proposed in this work and will help to protect the short-term key using a public-key cryptosystem with the receiver's public key.
Identity-based encryption with efficient revocation
This work proposes an IBE scheme that significantly improves key-update efficiency on the side of the trusted party (from linear to logarithmic in the number of users), while staying efficient for the users.
Attribute-based encryption for fine-grained access control of encrypted data
This work develops a new cryptosystem for fine-grained sharing of encrypted data that is compatible with Hierarchical Identity-Based Encryption (HIBE), and demonstrates the applicability of the construction to sharing of audit-log information and broadcast encryption.
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for
Secure Integration of Asymmetric and Symmetric Encryption Schemes
This conversion is the first generic transformation from an arbitrary one-way asymmetricryption scheme to a chosen-ciphertext secure asymmetric encryption scheme in the random oracle model.
Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles
Two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model are constructed.
Off-the-record communication, or, why not to use PGP
This paper presents a protocol for secure online communication, called "off-the-record messaging", which has properties better-suited for casual conversation than do systems like PGP or S/MIME.
An improved e-mail security protocol
  • B. SchneierChris Hall
  • Computer Science, Mathematics
    Proceedings 13th Annual Computer Security Applications Conference
  • 1997
This paper uses short-term private-key/public-key key pairs to reduce the magnitude of this vulnerability in e-mail security systems.
Attribute based data sharing with attribute revocation
This paper uniquely integrates the technique of proxy re-encryption with CP-ABE, and enables the authority to delegate most of laborious tasks to proxy servers, and shows that the proposed scheme is provably secure against chosen ciphertext attacks.