An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods

Bao, Feng; Deng, Robert H.; Feng, Peirong

doi:10.1007/3-540-45247-8_13

Cited by 31 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bao et al [39] and Schnorr et al [40] independently proposed similar PIR schemes using homomorphic encryption. Their schemes requires only O(1) computation to be done on-line.…”

Section: Private Information Retrievalmentioning

confidence: 99%

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

Nakano

Kiyomoto

Miyake

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYOblivious RAM (ORAM) schemes, the concept introduced by Goldreich and Ostrovsky, are very useful technique for protecting users' privacy when storing data in remote untrusted servers and running software on untrusted systems. However they are usually considered impractical due to their huge overhead. In order to reduce overhead, many improvements have been presented. Thanks to these improvements, ORAM schemes can be considered practical on cloud environment where users can expect huge storage and high computational power. Especially for private information retrieval (PIR), some literatures demonstrated they are usable. Also dedicated PIRs have been proposed and shown that they are usable in practice. Yet, they are still impractical for protecting software running on untrusted systems. We first survey recent researches on ORAM and PIR. Then, we present a practical software-based memory protection scheme applicable to several environments. The main feature of our scheme is that it records the history of accesses and uses the history to hide the access pattern. We also address implementing issues of ORAM and propose practical solutions for these issues.

show abstract

“…Bao et al [39] and Schnorr et al [40] independently proposed similar PIR schemes using homomorphic encryption. Their schemes requires only O(1) computation to be done on-line.…”

Section: Private Information Retrievalmentioning

confidence: 99%

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

Nakano

Kiyomoto

Miyake

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…On receipt of a pirated copy, the sequence is extracted by the trusted Technology Provider. Given the extracted sequence Y, the scores of all Buyers are computed using Equation (1). It is here that the Provider can lie, since the probabilities in p are only known by the Provider.…”

Section: Untrustworthy Content Providermentioning

confidence: 99%

“…This implies the use of a probabilistic encryption scheme. Unfortunately, semantic security has not yet been tackled in the Commutative Encryption literature [1,11,21]. Nevertheless, semantic security should be achieved in a near future, making this kind of OT particularly interesting for us.…”

Section: Details Of the Oblivious Transfer Protocolmentioning

confidence: 99%

An Asymmetric Fingerprinting Scheme Based on Tardos Codes

et al. 2011

View full text Add to dashboard Cite

Abstract. Asymmetric fingerprinting protocols are designed to prevent an untrustworthy Provider incriminating an innocent Buyer. These protocols enable the Buyer to generate their own fingerprint by themself, and ensure that the Provider never has access to the Buyer's copy of the Work. Until recently, such protocols were not practical because the collusion-resistant codes they rely on were too long. However, the advent of Tardos codes means that the probabilistic collusion-resistant codes are now sufficiently short that asymmetric fingerprint codes should, in theory, be practical. Unfortunately, previous asymmetric fingerprinting protocols cannot be directly applied to Tardos codes, because generation of the Tardos codes depends on a secret vector that is only known to the Provider. This knowledge allows an untrustworthy Provider to attack traditional asymmetric fingerprinting protocols. We describe this attack, and then propose a new asymmetric fingerprinting protocol, specifically designed for Tardos codes.

show abstract

“…Commutative cipher has been widely used in the literature for various purposes, e.g. protecting secrecy and privacy in e-commerce [2], [3], [7], data mining, information sharing [1], [8], and network routing [13]. In this work, we adopt commutative encryption to wrap the payload in layers.…”

Section: B Commutative Encryptionmentioning

confidence: 99%

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

Luo²,

Liu

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are highly desired. Existing approaches either rely on a relative small set of pre-selected relay servers to redirect the messages, or use structured peer-to-peer systems to multicast messages among a set of relay groups. The pre-selection approaches provide good anonymity, but suffer from node failures and scalability problem. The peer-to-peer approaches are subject to node churns and high maintenance overhead, which are the intrinsic problems of P2P systems.In this paper, we present CAT, a node-failure-resilient anonymous communication protocol. In this protocol, relay servers are randomly assigned to relay groups. The initiator of a connection selects a set of relay groups instead of relay servers to set up anonymous paths. A valid path consists of relay servers, one from each selected relay group. The initiator explores valid anonymous paths via a probing process. Since the relative positions of relay servers in the path are commutative, there exist multiple anonymous yet commutative paths, which form an anonymous tunnel. When a connection encounters a node failure, it quickly switches to a nearest backup path in the tunnel through "path hopping", without tampering the initiator or renegotiating the keys. Hence, the protocol is resilient to node failures. We also show that the protocol provides good anonymity even when facing types of active and passive attacks. Finally, the operating cost of CAT is analyzed and shown to be similar to other node-based anonymous communication protocols.

show abstract

An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods

Cited by 31 publications

References 10 publications

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation

An Asymmetric Fingerprinting Scheme Based on Tardos Codes

A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping

Contact Info

Product

Resources

About