Journal ArticleDOI
Anonymous proxy re-encryption
Reads0
Chats0
TLDR
This work proposes the first anonymous PRE with CCA security and collusion resistance, and is proved in the random oracle model based on the DDH assumption.Abstract:
Proxy re-encryption (PRE) is a public key encryption that allows a semi-trusted proxy with some information (a.k.a., re-encryption key) to transform a ciphertext under one public key into another ciphertext under another public key. Because of this special property, PRE has many applications, such as the distributed file system. Some of these applications demand that the underlying PRE scheme is anonymous under chosen-ciphertext attacks (CCAs); that is, the adversary cannot identify the recipient of the original/transformed ciphertext, even if it knows the PRE key and can launch the CCA. However, to the best of our knowledge, none of the existing PRE schemes satisfy this requirement. In this work, we propose the first anonymous PRE with CCA security and collusion resistance. Our proposal is proved in the random oracle model based on the DDH assumption. Copyright © 2011 John Wiley & Sons, Ltd.read more
Citations
More filters
Journal Article
Secure integration of asymmetric and symmetric encryption schemes
TL;DR: 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.
Book ChapterDOI
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
TL;DR: In this article, a zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit was proposed, where the soundness of the argument relies solely on the well-established discrete log-arm assumption in prime order groups.
Journal ArticleDOI
Conditional Identity-Based Broadcast Proxy Re-Encryption and Its Application to Cloud Email
TL;DR: This paper proposes a versatile primitive referred to as conditional identity-based broadcast PRE (CIBPRE) and formalizes its semantic security and shows an application of the CIBPRE to secure cloud email system advantageous over existing secure email systems based on Pretty Good Privacy protocol or identity- based encryption.
Journal ArticleDOI
Privacy-Preserving Ciphertext Multi-Sharing Control for Big Data Storage
TL;DR: A privacy-preserving ciphertext multi-sharing mechanism that combines the merits of proxy re-encryption with anonymous technique in which a ciphertext can be securely and conditionally shared multiple times without leaking both the knowledge of underlying message and the identity information of ciphertext senders/recipients is proposed.
Book ChapterDOI
Key-Private Proxy Re-encryption under LWE
TL;DR: This paper proposes a CPA-secure PK-PRE scheme in the standard model (which is then transformed into a CCA-secure scheme inThe random oracle model), and examines the practical hardness of the LWE assumption, using Kannan's exhaustive search algorithm coupling with pruning techniques.
References
More filters
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Book ChapterDOI
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
TL;DR: In this article, a new signature scheme is proposed together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem and the security of both systems relies on the difficulty of computing discrete logarithms over finite fields.
Journal ArticleDOI
Improved proxy re-encryption schemes with applications to secure distributed storage
TL;DR: Performance measurements of the experimental file system demonstrate the usefulness of proxy re-encryption as a method of adding access control to a secure file system and present new re-Encryption schemes that realize a stronger notion of security.
Book ChapterDOI
Divertible protocols and atomic proxy cryptography
TL;DR: A definition of protocol divertibility is given that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta's definition in the case of interactive zero-knowledge proofs and generalizes to cover several protocols not normally associated with divertibility.