• DocumentCode
    1972589
  • Title

    Pecan: A circuit-less P2P design for anonymity

  • Author

    Gang Xu ; Aguilera, L. ; Yong Guan

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
  • fYear
    2012
  • fDate
    3-7 Dec. 2012
  • Firstpage
    820
  • Lastpage
    825
  • Abstract
    We propose Pecan, a circuit-less, peer-to-peer low-latency anonymous system. In Pecan, users do not need to construct a circuit for communications. The anonymity is provided by Pecan´s highly peer-to-peer, circuit-less structure and the feature that all re-encryption keys are generated locally by the intermediate nodes themselves. Pecan also has stronger resistance against several DoS attacks that the circuit-based systems do not. The high anonymity is obtained without harming user experience: a user could send anonymous requests and get corresponding responses with less stringent requirements on the intermediate nodes involved on the route. Pecan´s design is based on a revised onion routing and a new proxy re-encryption algorithm. These cryptographic algorithms maintain a small amount of processing overhead for system nodes. Our analysis and experiment showed the total processing delay is relatively small in comparison to the whole end-to-end latency. The throughput is satisfactory for normal users´ online activities.
  • Keywords
    computer network security; cryptography; peer-to-peer computing; telecommunication network routing; DoS attacks; Pecan; circuit-based systems; circuit-less P2P design; circuit-less peer-to-peer low-latency anonymous system; cryptographic algorithms; processing delay; proxy reencryption algorithm; reencryption key generation; revised onion routing; system node overhead; Anonymity; Circuit-less; P2P; Proxy Re-encryption;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Communications Conference (GLOBECOM), 2012 IEEE
  • Conference_Location
    Anaheim, CA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4673-0920-2
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2012.6503214
  • Filename
    6503214