A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Rigorous Time/Space Trade-offs for Inverting Functions
SIAM Journal on Computing
Secure communications over insecure channels
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Pricing via Processing or Combatting Junk Mail
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Curbing Junk E-Mail via Secure Classification
FC '98 Proceedings of the Second International Conference on Financial Cryptography
A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Proofs of Work and Bread Pudding Protocols
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
Time-lock Puzzles and Timed-release Crypto
Time-lock Puzzles and Timed-release Crypto
CAPTCHA: using hard AI problems for security
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Anti-vamming trust enforcement in peer-to-peer VoIP networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Flexible OS support and applications for trusted computing
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Security when people matter: structuring incentives for user behavior
Proceedings of the ninth international conference on Electronic commerce
Wireless client puzzles in IEEE 802.11 networks: security by wireless
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Quantifying Resistance to the Sybil Attack
Financial Cryptography and Data Security
Using rhythmic nonces for puzzle-based DoS resistance
Proceedings of the 2nd ACM workshop on Computer security architectures
Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
ACM Transactions on Computer Systems (TOCS)
Bayesian analysis of secure P2P sharing protocols
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Low-cost client puzzles based on modular exponentiation
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Efficient certification path discovery for MANET
EURASIP Journal on Wireless Communications and Networking
Reconstructing hash reversal based proof of work schemes
LEET'11 Proceedings of the 4th USENIX conference on Large-scale exploits and emergent threats
Proceedings of the 8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference
Time-lock puzzles in the random oracle model
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Security in p2p networks: survey and research directions
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Canal: scaling social network-based Sybil tolerance schemes
Proceedings of the 7th ACM european conference on Computer Systems
Secure client puzzles based on random beacons
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Adaptive selective verification: an efficient adaptive countermeasure to thwart DoS attacks
IEEE/ACM Transactions on Networking (TON)
Hourglass schemes: how to prove that cloud files are encrypted
Proceedings of the 2012 ACM conference on Computer and communications security
Revisiting difficulty notions for client puzzles and dos resilience
ISC'12 Proceedings of the 15th international conference on Information Security
Iolaus: securing online content rating systems
Proceedings of the 22nd international conference on World Wide Web
| Hi-index | 0.00 |
A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. It has been suggested that such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we research moderately hard functions that most recent systems will evaluate at about the same speed. For this purpose, we rely on memory-bound computations. We describe and analyze a family of moderately hard, memory-bound functions, and we explain how to use them for protecting against abuses.