Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Riffle

Riffle Abstract Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity with low bandwidth overhead, but suffer from high computation overhead instead. In this paper, we present Riffle, a bandwidth and computation efficient communication system with strong anonymity. Riffle consists of a small set of anonymity servers and a large number of users, and guarantees anonymity among all honest clients as long as there exists at least one honest server. Riffle uses a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. Our evaluation of Riffle in file sharing and microblogging applications shows that Riffle can achieve a bandwidth of over 100KB/s per user in an anonymity set of 200 users in the case of file sharing, and handle over 100,000 users with less than 10 second latency in the case of microblogging. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Riffle

Download PDF
20 pages

Loading next page...
 
/lp/de-gruyter/riffle-MPGvpFeXYj
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2016-0008
Publisher site
See Article on Publisher Site

Abstract

Abstract Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity with low bandwidth overhead, but suffer from high computation overhead instead. In this paper, we present Riffle, a bandwidth and computation efficient communication system with strong anonymity. Riffle consists of a small set of anonymity servers and a large number of users, and guarantees anonymity among all honest clients as long as there exists at least one honest server. Riffle uses a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. Our evaluation of Riffle in file sharing and microblogging applications shows that Riffle can achieve a bandwidth of over 100KB/s per user in an anonymity set of 200 users in the case of file sharing, and handle over 100,000 users with less than 10 second latency in the case of microblogging.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Apr 1, 2016

References

  • Secretbox godoc https godoc org golang org x crypto nacl secretbox
  • New directions in cryptography Theory Transactions on Nov
    Diffie
  • Herbivore Efficient Protocol for Anonymous Technical Report University
    Goel
  • Anonymous communication policies for the internet : Results and recommendations of the aaas conference
    Teich
  • Secretbox godoc https godoc org golang org x crypto nacl secretbox
  • Tor The Second - Generation Onion Router In Proceedings of the th pages
    Dingledine
  • Eluding carnivores File sharing with strong anonymity In In of Workshop
    Sirer
  • Tor metrics portal https metrics torproject org
  • Curve new diffie hellman speed records In In Verlag page
    Bernstein
  • Improved website fingerprinting on tor In Proceedings of the Workshop on Privacy in the Electronic November
    Wang
  • https bittorrent com
    Bittorrent
  • electronic mail return addresses and digital pseudonyms Feb
    Chaum
  • network emulation testbed http www emulab net
    Emulab
  • The pynchon gate secure method of pseudonymous mail retrieval In Proceedings of the Workshop on Privacy in the Electronic pages New
    Sassaman
  • https bittorrent com
    Bittorrent
  • - Protocols Attacks Design and Open Problems In editor Proceedings of Designing Workshop on Design Issues in Anonymity and pages Verlag
    Raymond
  • - Protocols Attacks Design and Open Problems In editor Proceedings of Designing Workshop on Design Issues in Anonymity and pages Verlag
    Raymond
  • Four practical attacks for optimistic mixing for exit - polls
    Wikström
  • Design of a type iii anonymous remailer protocol In In Proceedings of the on and pages
    Danezis
  • Goldwasser Probabilistic encryption ; how to play mental poker keeping secret all partial information In Proceedings of the Fourteenth Annual ACM Symposium on Theory of pages New York
    Micali
  • Four practical attacks for optimistic mixing for exit - polls
    Wikström
  • Distributed point functions and their applications In editors Advances in - volume of in pages
    Gilboa
  • Proof systems for general statements about discrete logarithms Technical report
    Camenisch
  • Efficient zero - knowledge argument for correctness of a shuffle In Proceedings of the st Annual International Conference on Theory and Applications of Cryptographic Techniques pages Verlag
    Bayer
  • Blond Towards efficient traffic - analysis resistant anonymity networks In Proceedings of the ACM Conference on pages New
    Le
  • New directions in cryptography Theory Transactions on Nov
    Diffie
  • Website Fingerprinting in Onion Routing Based Anonymization In Proceedings of the ACM Workshop on Privacy in the Electronic pages
    Panchenko
  • Efficient anonymity - preserving data collection In Proceedings of the th International Conference on Knowledge Discovery and Data Mining pages New York
    Brickell
  • Practical traffic analysis extending and resisting statistical disclosure In th International Workshop on Privacy
    Mathewson
  • Breaking an efficient anonymous channel In In pages Verlag
    Pfitzmann
  • An efficient scheme for proving a shuffle In In Proc of pages Verlag
    Furukawa
  • Secret key authenticated encryption http nacl cr yp to secretbox html
  • Anonymous web transactions with crowds Feb
    Reiter
  • Breaking an efficient anonymous channel In In pages Verlag
    Pfitzmann
  • Low - cost traffic analysis of tor In Proceedings of the on and pages
    Murdoch
  • Anonymous communication policies for the internet : Results and recommendations of the aaas conference
    Teich
  • New stream cipher designs chapter The Salsa of Stream Ciphers pages Verlag
    Bernstein
  • Sips The bittorrent file sharing system Measurements analysis In editors Peer to - Peer volume of in pages
    Pouwelse
  • Efficient anonymity - preserving data collection In Proceedings of the th International Conference on Knowledge Discovery and Data Mining pages New York
    Brickell
  • The dining cryptographers problem Unconditional sender and recipient untraceability
    Chaum
  • Wallet databases with observers In Proceedings of the th Annual International Cryptology Conference on Advances in pages London Verlag
    Chaum
  • Chor Kushilevitz Goldreich Sudan Private information Nov
  • Proactively accountable anonymous messaging in verdict In Presented as part of the nd pages
    Corrigan
  • The dining cryptographers in the disco : Unconditional sender and recipient untraceability with computationally secure serviceability In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology pages
    Waidner
  • Efficient zero - knowledge argument for correctness of a shuffle In Proceedings of the st Annual International Conference on Theory and Applications of Cryptographic Techniques pages Verlag
    Bayer
  • Authenticated encryption : Relations among notions and analysis of the generic composition paradigm
    Bellare
  • How to break the direct rsa - implementation of mixes In Advances in Cryptology - pages Verlag
    Pfitzmann
  • Authenticated encryption : Relations among notions and analysis of the generic composition paradigm
    Bellare
  • Anonymous web transactions with crowds Feb
    Reiter
  • Chor Computationally private information retrieval ( extended abstract In Proceedings of the Twenty - ninth Annual ACM Symposium on Theory of pages New York
    Gilboa
  • Riposte An Anonymous Messaging System Handling Millions of Users prints
    Corrigan
  • Design of a type iii anonymous remailer protocol In In Proceedings of the on and pages
    Danezis
  • Improved website fingerprinting on tor In Proceedings of the Workshop on Privacy in the Electronic November
    Wang
  • Touching from a distance : Website fingerprinting attacks and defenses In Proceedings of the th ACM conference on Computer and Communications
    Cai
  • Chor Kushilevitz Goldreich Sudan Private information Nov
  • network emulation testbed http www emulab net
    Emulab
  • Curve new diffie hellman speed records In In Verlag page
    Bernstein
  • Sips The bittorrent file sharing system Measurements analysis In editors Peer to - Peer volume of in pages
    Pouwelse
  • Tor metrics portal https metrics torproject org
  • electronic mail return addresses and digital pseudonyms Feb
    Chaum
  • Website Fingerprinting in Onion Routing Based Anonymization In Proceedings of the ACM Workshop on Privacy in the Electronic pages
    Panchenko
  • Chor Computationally private information retrieval ( extended abstract In Proceedings of the Twenty - ninth Annual ACM Symposium on Theory of pages New York
    Gilboa
  • Eluding carnivores File sharing with strong anonymity In In of Workshop
    Sirer
  • The pynchon gate secure method of pseudonymous mail retrieval In Proceedings of the Workshop on Privacy in the Electronic pages New
    Sassaman
  • Distributed point functions and their applications In editors Advances in - volume of in pages
    Gilboa
  • Proof systems for general statements about discrete logarithms Technical report
    Camenisch
  • The dining cryptographers in the disco : Unconditional sender and recipient untraceability with computationally secure serviceability In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology pages
    Waidner
  • with your buddies to resist intersection attacks In Proceedings of the conference on Computer pages New
    Wolinsky
  • Practical traffic analysis extending and resisting statistical disclosure In th International Workshop on Privacy
    Mathewson
  • Tor The Second - Generation Onion Router In Proceedings of the th pages
    Dingledine
  • New stream cipher designs chapter The Salsa of Stream Ciphers pages Verlag
    Bernstein
  • An efficient scheme for proving a shuffle In In Proc of pages Verlag
    Furukawa
  • Blond Towards efficient traffic - analysis resistant anonymity networks In Proceedings of the ACM Conference on pages New
    Le
  • Goldwasser Probabilistic encryption ; how to play mental poker keeping secret all partial information In Proceedings of the Fourteenth Annual ACM Symposium on Theory of pages New York
    Micali
  • Circuit fingerprinting attacks : Passive deanonymization of tor hidden services In th pages Aug
    Kwon
  • Advanced crypto library for the go language https github com DeDiS crypto
  • Wallet databases with observers In Proceedings of the th Annual International Cryptology Conference on Advances in pages London Verlag
    Chaum
  • Website fingerprinting : Attacking popular privacy enhancing technologies with the multinomial naive - bayes classifier In Proceedings of the Workshop on Cloud pages New
    Herrmann
  • Website fingerprinting : Attacking popular privacy enhancing technologies with the multinomial naive - bayes classifier In Proceedings of the Workshop on Cloud pages New
    Herrmann
  • Low - cost traffic analysis of tor In Proceedings of the on and pages
    Murdoch
  • On the computational practicality of private information retrieval
    Sion
  • Circuit fingerprinting attacks : Passive deanonymization of tor hidden services In th pages Aug
    Kwon
  • How to break the direct rsa - implementation of mixes In Advances in Cryptology - pages Verlag
    Pfitzmann
  • Riposte An Anonymous Messaging System Handling Millions of Users prints
    Corrigan
  • Advanced crypto library for the go language https github com DeDiS crypto
  • Proactively accountable anonymous messaging in verdict In Presented as part of the nd pages
    Corrigan
  • with your buddies to resist intersection attacks In Proceedings of the conference on Computer pages New
    Wolinsky
  • The dining cryptographers problem Unconditional sender and recipient untraceability
    Chaum
  • Secret key authenticated encryption http nacl cr yp to secretbox html
  • On the computational practicality of private information retrieval
    Sion
  • Touching from a distance : Website fingerprinting attacks and defenses In Proceedings of the th ACM conference on Computer and Communications
    Cai
  • Herbivore Efficient Protocol for Anonymous Technical Report University
    Goel