The dual receiver cryptosystem and its applications

Diament, Theodore; Lee, Homin K.; Keromytis, Angelos D.; Yung, Moti

doi:10.1145/1030083.1030128

Cited by 31 publications

(43 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Diament et al [11] first introduce the notion of an efficient dual receiver cryptosystem, which enables a ciphertext to be decrypted by two independent receivers. The main disadvantage of the dual receiver cryptosystem is that the server needs to send an auxiliary private key to a client for decrypting a partial ciphertext, which is insecure in the real environment.…”

Section: A Related Workmentioning

confidence: 99%

An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing

Liu

Wang

2009

2009 International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

Abstract-A user stores his personal files in a cloud, and retrieves them wherever and whenever he wants. For the sake of protecting the user data privacy and the user queries privacy, a user should store his personal files in an encrypted form in a cloud, and then sends queries in the form of encrypted keywords. However, a simple encryption scheme may not work well when a user wants to retrieve only files containing certain keywords using a thin client. First, the user needs to encrypt and decrypt files frequently, which depletes too much CPU capability and memory power of the client. Second, the service provider couldn't determine which files contain keywords specified by a user if the encryption is not searchable. Therefore, it can only return back all the encrypted files. A thin client generally has limited bandwidth, CPU and memory, and this may not be a feasible solution under the circumstances. In this paper, we investigate the characteristics of cloud computing and propose an efficient privacy preserving keyword search scheme in cloud computing. It allows a service provider to participate in partial decipherment to reduce a client's computational overhead, and enables the service provider to search the keywords on encrypted files to protect the user data privacy and the user queries privacy efficiently. By proof, our scheme is semantically secure.

show abstract

Section: A Related Workmentioning

confidence: 99%

An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing

Liu

Wang

2009

2009 International Conference on Computational Science and Engineering

View full text Add to dashboard Cite

show abstract

“…At the core of our constructions for realizing F keia is a chosenciphertext (CCA) secure variant of Dual Receiver Encryption (DRE) [15]. DRE allows anyone to encrypt a message to two parties with a single ciphertext, with the guarantee that attempts to decrypt a ciphertext by either of the two recipients will produce the same result.…”

Section: Constructionmentioning

confidence: 99%

Composability and On-Line Deniability of Authentication

Dodis

Katz

Smith

et al. 2009

Theory of Cryptography

View full text Add to dashboard Cite

Abstract. Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability, where deniability should hold even when one of the parties colludes with a third party during execution of the protocol. This turns out to generalize several realistic scenarios that are outside the scope of previous models.We show that a protocol achieves our definition of on-line deniability if and only if it realizes the message authentication functionality in the generalized universal composability framework; any protocol satisfying our definition thus automatically inherits strong composability guarantees. Unfortunately, we show that our definition is impossible to realize in the PKI model if adaptive corruptions are allowed (even if secure erasure is assumed). On the other hand, we show feasibility with respect to static corruptions (giving the first separation in terms of feasibility between the static and adaptive setting), and show how to realize a relaxation termed deniability with incriminating abort under adaptive corruptions.

show abstract

“…More generally, cryptographic puzzles have been employed for this purpose in the contexts of key agreement [44], defending against junk e-mail [26], creating digital time capsules [48], metering Web site usage [30], lotteries [34,56] and fair exchange [15,31,56]. Recent proposals for puzzle design include puzzle outsourcing [61] and implementation of the dual receiver cryptosystem [23]. Whereas most puzzle proposals impose a number of computational steps to generate a solution, a "memory bound" alternative imposing memory accesses has been devised in an effort to impose similar puzzle solving delay even on clients with very different computational power [3].…”

Section: Client Puzzlesmentioning

confidence: 99%

A multi-layer framework for puzzle-based denial-of-service defense

Reiter

2007

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Client puzzles have been advocated as a promising countermeasure to denial-of-service (DoS) attacks in recent years. However, how to operationalize this idea in network protocol stacks still has not been sufficiently studied. In this paper, we describe our research on a multi-layer puzzle-based DoS defense architecture, which embeds puzzle techniques into both end-to-end and IP-layer services. Specifically, our research results in two new puzzle techniques: puzzle auctions for end-to-end protection and congestion puzzles for IP-layer protection. We present the designs of these approaches and evaluations of their efficacy. We demonstrate that our techniques effectively mitigate DoS threats to IP, TCP and application protocols; maintain full interoperability with legacy systems; and support incremental deployment. We also provide a game theoretic analysis that sheds light on the potential to use client puzzles for incentive engineering: the costs of solving puzzles on an attackers' behalf could motivate computer owners to more aggressively cleanse their computers of malware, in turn hindering the attacker from capturing a large number of computers with which it can launch DoS attacks.

show abstract

The dual receiver cryptosystem and its applications

Cited by 31 publications

References 47 publications

An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing

An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing

Composability and On-Line Deniability of Authentication

A multi-layer framework for puzzle-based denial-of-service defense

Contact Info

Product

Resources

About