Making puzzles green and useful for adaptive identity management in large-scale distributed systems
| Autor: | Hanna Kavalionak, Weverton Cordeiro, Alessio Guerrieri, Marinho P. Barcellos, Alberto Montresor, Luciano Paschoal Gaspary, Flavio Roberto Santos |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Proof of work
Computer Networks and Communications Computer science Process (engineering) Sybil attack media_common.quotation_subject Distributed computing 02 engineering and technology Peer-to-peer networks Computer security computer.software_genre Identity management Fake accounts 0202 electrical engineering electronic engineering information engineering media_common 020206 networking & telecommunications Energy consumption Task (computing) Proof-of-work system Computational puzzles Identity (object-oriented programming) 020201 artificial intelligence & image processing computer Reputation |
| Zdroj: | Computer networks (1999) 95 (2016): 97–114. doi:10.1016/j.comnet.2015.12.005 info:cnr-pdr/source/autori:Cordeiro W.L.D.C.; Santos F.R.; Barcelos M.P.; Gaspary L.P.; Kavalionak H.; Guerrieri A.; Montresor A./titolo:Making puzzles green and useful for adaptive identity management in large-scale distributed systems/doi:10.1016%2Fj.comnet.2015.12.005/rivista:Computer networks (1999)/anno:2016/pagina_da:97/pagina_a:114/intervallo_pagine:97–114/volume:95 |
| ISSN: | 1389-1286 |
| DOI: | 10.1016/j.comnet.2015.12.005 |
| Popis: | Various online systems offer a lightweight process for creating accounts (e.g., confirming an e-mail address), so that users can easily join them. With minimum effort, however, an attacker can subvert this process, obtain a multitude of fake accounts, and use them for malicious purposes. Puzzle-based solutions have been proposed to limit the spread of fake accounts, by establishing a price (in terms of computing resources) per identity requested. Although effective, they do not distinguish between requests coming from presumably legitimate users and potential attackers, and also lead to a significant waste of energy and computing power. In this paper, we build on adaptive puzzles and complement them with waiting time to introduce a green design for lightweight, long-term identity management; it balances the complexity of assigned puzzles based on the reputation of the origin (source) of identity requests, and reduces energy consumption caused by puzzle-solving. We also take advantage of lessons learned from massive distributed computing to come up with a design that makes puzzle-processing useful. Based on a set of experiments, we show that our solution provides significant energy savings and makes puzzle-solving a useful task, while not compromising effectiveness in limiting the spread of fake accounts. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect