Conditional Privacy Using Re-encryption

Suriadi, S.; Foo, Ernest; Smith, Jason

doi:10.1109/npc.2008.37

Cited by 7 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We then presented the first construction under standard assumptions in the standard model. Our construction is efficient enough for several practical PRE applications, such as [1,13,10,12]. Our construction realizes CPA-security.…”

Section: Conclusion and Open Problemsmentioning

confidence: 95%

See 1 more Smart Citation

Key-Private Proxy Re-encryption

Ateniese

Benson

Hohenberger

2009

Lecture Notes in Computer Science

135

View full text Add to dashboard Cite

Proxy re-encryption (PRE) allows a proxy to convert a ciphertext encrypted under one key into an encryption of the same message under another key. The main idea is to place as little trust and reveal as little information to the proxy as necessary to allow it to perform its translations. At the very least, the proxy should not be able to learn the keys of the participants or the content of the messages it re-encrypts. However, in all prior PRE schemes, it is easy for the proxy to determine between which participants a re-encryption key can transform ciphertexts. This can be a problem in practice. For example, in a secure distributed file system, content owners may want to use the proxy to help re-encrypt sensitive information without revealing to the proxy the identity of the recipients.In this work, we propose key-private (or anonymous) re-encryption keys as an additional useful property of PRE schemes. We formulate a definition of what it means for a PRE scheme to be secure and key-private. Surprisingly, we show that this property is not captured by prior definitions or achieved by prior schemes, including even the secure obfuscation of PRE by Hohenberger et al. (TCC 2007). Finally, we propose the first key-private PRE construction and prove its CPA-security under a simple extension of Decisional Bilinear Diffie Hellman assumption and its key-privacy under the Decision Linear assumption in the standard model.

show abstract

Section: Conclusion and Open Problemsmentioning

confidence: 95%

“…In [12], Suriadi, Foo and Smith use proxy re-encryption to develop a credential system with conditional privacy. Their system has many proxies providing keys to parities who wish to remain anonymous.…”

Section: Applicationsmentioning

confidence: 99%

Key-Private Proxy Re-encryption

Ateniese

Benson

Hohenberger

2009

Lecture Notes in Computer Science

135

View full text Add to dashboard Cite

show abstract

“…We compare our protocol with two alternative very popular encryption techniques, the Chaum mixing scheme and the identity based proxy re‐encryption (IB‐PRE) scheme , which have been proposed by the research community and applied in numerous scenarios, ranging from web browsing to data storage and sharing.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, this scheme guarantees unidirectionality, meaning that a user A can delegate to another user B, without permitting A to decrypt B's ciphertexts, and non‐interactivity, meaning that a user A can construct a re‐encryption key without the participation of B. The IB‐PRE has been adopted to secure communications and provide anonymity in many different frameworks .…”

Section: Introductionmentioning

confidence: 99%

A protocol for metering data pseudonymization in smart grids

Rottondi

Mauri

Verticale

2013

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

A tradeoff between data collection needs and user privacy is of paramount importance in the Smart Grid. This paper proposes a pseudonymization protocol for data gathered by the Smart Metres, which relies on a network infrastructure and a dedicated set of nodes, called privacy preserving nodes. The network privacy is enforced by a separation of duties; the privacy preserving nodes perform data pseudonymization without having access to the measurements, which are masked by means of a secret sharing scheme, while the entities accessing the data recover and relate the plain measurements generated by the same metre along a time window of finite duration but have no access to the metre identities. The paper also provides an evaluation of the security and of the performance of the protocol, comparing it to the two alternative encryption techniques, which mask the measurements by means of the Chaum mixing scheme or of an identity‐based proxy re‐encryption scheme. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

“…PRE has been proven useful in many applications such as access control in encrypted email forwarding [11] , distributed file storage [12] , digital rights management (DRM) [13] [14] , privacy preserving in anonymity revocation [15] and so on.…”

Section: Introductionmentioning

confidence: 99%

Attribute-Based Conditional Proxy Re-Encryption with Chosen-Ciphertext Security

Zhao¹,

Feng

Zhang

2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

Proxy re-encryption is a cryptographic primitive which enables a ciphertext encrypted under a delegator's public key to be translated into a ciphertext of a delegatee by a semitrusted proxy. Conditional proxy re-encryption (CPRE) is a variant of proxy re-encryption which allows the delegator to control the delegation of decryption rights with certain conditional value. The existing CPRE schemes left an open problem about how to construct CCA-secure CPRE schemes supporting Boolean predicates over conditions. In this paper, we propose attribute-based CPRE (AB-CPRE) in which the delegator could implement attributed-based control on the delegation of decryption rights by setting conditions in the form of access structure and attribute set. AB-CPRE is suitable for applications where fine-grained control of the decryption delegation is necessary. We formalize definitions and security notions for AB-CPRE and prove that the proposed scheme is chosen-ciphertext secure under the 3-Quotient Decision Bilinear Diffie-Hellman (3-QDBDH) assumption.

show abstract

Conditional Privacy Using Re-encryption

Abstract: Abstract

Cited by 7 publications

References 20 publications

Key-Private Proxy Re-encryption

Key-Private Proxy Re-encryption

A protocol for metering data pseudonymization in smart grids

Attribute-Based Conditional Proxy Re-Encryption with Chosen-Ciphertext Security

Contact Info

Product

Resources

About