Book ChapterDOI
Anonymous ID-based proxy re-encryption
Jun Shao
- pp 364-375
TLDR
The first AIBPRE scheme is proposed, which can be proven-secure in the random oracle model based on the decisional bilinear Diffie-Hellman assumption and modified decisional BilinearDiffie- hellman assumption.Abstract:Â
ID-based proxy re-encryption (IBPRE) allows a proxy with some information (a.k.a. re-encryption key) to transform the ciphertext under one identity to another ciphertext under another identity. These two ciphertexts can yield the same plaintext, while the proxy cannot get any information of the plaintext. Due to its transformable functionality, IBPRE can be used in many applications. Some of these applications require that the underlying IBPRE scheme is CCA-secure and anonymous. However, to the best of our knowledge, none of the existing schemes satisfy the security requirement. In this paper, we first extend the concept of IBPRE to that of anonymous IBPRE (AIBPRE), including the definition and security model. After that, we propose the first AIBPRE scheme, which can be proven-secure in the random oracle model based on the decisional bilinear Diffie-Hellman assumption and modified decisional bilinear Diffie-Hellman assumption.read more
Citations
More filters
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
Protection of Big Data Privacy
TL;DR: The infrastructure of big data and the state-of-the-art privacy-preserving mechanisms in each stage of the big data life cycle are illustrated and the challenges for existing mechanisms are presented.
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
Public key cryptography -- PKC 2008 : 11th International Workshop on Practice and Theory in Public Key Cryptography, Barcelona, Spain, March 9-12, 2008 : proceedings
TL;DR: In this paper, the authors discuss the theory of public key encryption and the security of digital signature schemes in the context of cryptosystems over prime fields, and present a digital signature scheme based on CVP.
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
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
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.
Book ChapterDOI
Self Protecting Pirates and Black-Box Traitor Tracing
Aggelos Kiayias,Moti Yung +1 more
TL;DR: In this article, it was shown that the Boneh-Franklin (BF) scheme and the Kurosawa-Desmedt (KDS) scheme have no black-box traceability in the self-protecting model when the number of traitors is super-logarithmic.
Journal Article
Self protecting pirates and black-box traitor tracing
Aggelos Kiayias,Moti Yung +1 more
TL;DR: This work constructively proves that any system that fails this condition, is incapable of tracing pirate-decoders that contain keys based on a superlogarithmic number of traitor keys, and investigates a weaker form of black-box tracing called single-query "black-box confirmation."