Addressing Click Fraud in Content Delivery Systems
Published 1 January 2007
Saugat Majumdar, Dhananjay Kulkarni, Chinya V. Ravishankar
Citations20
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Analytical and experimental results show that the proposed protocols to verify broker honesty for data accesses under standard security assumptions in such systems are robust against replay and fabrication attacks, and are consistently able to identify broker dishonesty.
Abstract
Mechanisms for data access and payment are central to the success of content delivery systems. However, not much attention has been paid to the issues of dishonest intermediaries (brokers) or client collusion with dishonest brokers. We propose protocols to verify broker honesty for data accesses under standard security assumptions in such systems. Analytical and experimental results show that our protocols are robust against replay and fabrication attacks, and are consistently able to identify broker dishonesty.
Keywords
Computer Science
Communications of the ACMSpace/time trade-offs in hash coding with allowable errors
7,507 Citations1970Burton H. Bloom
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Lecture notes in computer scienceIdentity-Based Encryption from the Weil Pairing
6,986 Citations2001Dan Boneh, Matthew Franklin
This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
Lecture notes in computer scienceHow To Prove Yourself: Practical Solutions to Identification and Signature Problems
3,870 Citations2007Amos Fiat, Adi Shamir
Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.
SIAM Journal on ComputingIdentity-Based Encryption from the Weil Pairing
3,540 Citations2003Dan Boneh, Matthew Franklin
SIAM Journal on ComputingA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
2,776 Citations1988Shafi Goldwasser, Silvio Micali +1 more
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.
Cryptography: Theory and Practice
2,673 Citations1995Douglas R. Stinson
Journal of CryptologySecurity Arguments for Digital Signatures and Blind Signatures
2,186 Citations2000David Pointcheval, Jacques Stern
It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.
Lecture notes in computer scienceA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
1,430 Citations1998Ronald Cramer, Victor Shoup
A new public key cryptosystem is proposed and analyzed that is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions.
Lecture notes in computer scienceUntraceable Electronic Cash
1,109 Citations1990David Chaum, Amos Fiat +1 more
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 and receiving from the second party a note including a digital signature.
Lecture notes in computer scienceNon-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
1,043 Citations2007Charles Rackoff, Daniel Simón
A formalization of chosen ciphertext attack is given in the model which is stronger than the "lunchtime attack" considered by Naor and Yung, and it is proved a non-interactive public-key cryptosystem based on non-Interactive zero-knowledge proof of knowledge to be secure against it.
Probability, Random Processes, and Estimation Theory for Engineers
593 Citations1986Henry Stark, John W. Woods
Lecture notes in computer sciencePractical Verifiable Encryption and Decryption of Discrete Logarithms
528 Citations2003Jan Camenisch, Victor Shoup
This paper presents a variant of the new public key encryption of Cramer and Shoup based on Paillier's decision composite residuosity assumption, along with efficient protocols for verifiable encryption and decryption of discrete logarithms.
IEEE Journal on Selected Areas in CommunicationsOptimistic fair exchange of digital signatures
478 Citations2000N. Asokan, Victor Shoup +1 more
A new protocol is presented that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does.
Lecture notes in computer scienceCompact E-Cash
429 Citations2005Jan Camenisch, Susan Hohenberger +1 more
This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2 coins each of which she can spend unlinkably, and offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent.
Lecture notes in computer sciencePriced Oblivious Transfer: How to Sell Digital Goods
406 Citations2001Bill Aiello, Yuval Ishai +1 more
The first one-round (two-pass) protocol for oblivious transfer that does not rely on the random oracle model is presented, which is a special case of a more general "conditional disclosure" methodology, which extends a previous approach from [11] and adapts it to the 2-party setting.
Approximately detecting duplicates for streaming data using stable bloom filters
181 Citations2006Fan Deng, Davood Rafiei
This work introduces a data structure, Stable Bloom Filter, and a novel and simple algorithm, and shows that a tight upper bound of false positive rates is guaranteed and compares SBF to alternative methods.
Security issues and requirements for Internet-scale publish-subscribe systems
175 Citations2003Chenxi Wang, Antonio Carzaniga +2 more
This paper investigates the security issues and requirements that arise in an internet-scale content-based pub-sub system and distinguishes among those requirements that can be achieved with current technology and those that require innovative solutions.
iKP: a family of secure electronic payment protocols
145 Citations1995Mihir Bellare, Juan A. Garay +6 more
Duplicate detection in click streams
137 Citations2005Ahmed Metwally, Divyakant Agrawal +1 more
The problem of finding duplicates in data streams is considered, and a solution based on Bloom Filters is developed, demonstrating that the proposed solution yields extremely low error rates.
Lecture notes in computer scienceSecure and efficient off-line digital money (extended abstract)
85 Citations1993Matthew Franklin, Moti Yung
It is shown that off-line coin schemes can be implemented securely and efficiently, where security is proven based on the hardness of the discrete log function and a pre-processing stage, and where efficiency is in a new sense.
Computer NetworksOn the security of pay-per-click and other Web advertising schemes
72 Citations1999Vinod Anupam, Alain Mayer +3 more
A hit inflation attack on pay-per-click Web advertising schemes is presented, which is virtually impossible for the program provider to detect conclusively, regardless of whether the provider is a third-party ‘ad network’ or the target of the click itself.
Security aspects in publish/subscribe systems
54 Citations2004Ludger Fiege
This paper analyzes the trust relationships between producers, consumers, and the notification infrastructure and devise groups of trust to model and implement security constraints both on the application and the system level.
Pricing in publish/subscribe systems
1 Citations2004Andreas Tanner, Michael A. Jaeger
A new strategyproof distributed algorithm that calculates the maximum subtree of the broker network and the costs arising for the clients and an adjustment is presented that considers different rates for subscriptions and therefore weakens the previous all-or-nothing scenario.