Submission Data for 2020-2021 CORE Conference Ranking Process Privacy Enhancing Technologies Symposium (Was International Workshop of Privacy Enhancing Technologies)

Total Page:16

File Type:pdf, Size:1020Kb

Submission Data for 2020-2021 CORE Conference Ranking Process Privacy Enhancing Technologies Symposium (Was International Workshop of Privacy Enhancing Technologies) Submission Data for 2020-2021 CORE conference Ranking process Privacy Enhancing Technologies Symposium (was International Workshop of Privacy Enhancing Technologies) Shaanan Cohney, Matthew Wright, Aaron Johnson, Veelasha Moonsamy Conference Details Conference Title: Privacy Enhancing Technologies Symposium (was International Workshop of Privacy Enhancing Technologies) Acronym : PETS Rank: B Requested Rank Rank: A Recent Years Proceedings Publishing Style Proceedings Publishing: journal Link to most recent proceedings: https://dblp.org/db/journals/popets/popets2020.html Further details: PETS papers are published in the journal Proceedings on Privacy Enhancing Technologies (PoPETs). PoPETs is an open-access journal published by Sciendo, part of the De Gruyter publishing house. PoPETs has four issues per year, and all papers that appear in PoPETs are full papers and are presented at the PETS conference. PoPETs builds on the scholarly tradition initiated by PETS in July 2000. The membership of the Editorial Board and Program Committee, as well as the high-quality publications, make PoPETs a premier venue for scholarship in the area of privacy and technology. Regarding Google Scholar Metrics, PoPETs is listed. However, the PoPETs journal only started in 2015, and Google Scholar Metrics doesn’t include the 2000âĂŞ2014 PETS proceedings published in Springer LNCS. Therefore, rankings are inaccurate that use metrics dependings on papers published before 2015 (e.g. h5-index). Most Recent Years Most Recent Year Year: 2019 URL: https://petsymposium.org/cfp19.php Location: Stockholm, Sweden Papers submitted: 300 Papers published: 67 Acceptance rate: 22 Source for numbers: https://petsymposium.org/acceptance-rates.php General Chairs Name: Panos Papadimitratos Affiliation: KTH Gender: M H Index: 52 GScholar url: https://scholar.google.ca/citations?hl=en&user=Iv2wBQ8AAAAJ DBLP url: Name: Simone Fischer-HÃijbner Affiliation: Karlstad University, Sweden Gender: F H Index: 22 GScholar url: DBLP url: https://dblp.org/pid/f/SimoneFischerHubner.html 1 Program Chairs Name: Carmela Tronosco Affiliation: EPFL Gender: F H Index: 27 GScholar url: https://scholar.google.ca/citations?user=sMkt3SgAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/01/4825.html Name: Kostas Chatzikokolakis Affiliation: University of Athens Gender: M H Index: 23 GScholar url: https://scholar.google.com/citations?user=0XpXCu8AAAAJ&hl=en&oi=sra DBLP url: https://dblp.org/pid/32/858.html Second Most Recent Year Year: 2018 URL: https://petsymposium.org/cfp18.php Location: Barcelona, Spain Papers submitted: 229 Papers published: 36 Acceptance rate: 16 Source for numbers: https://petsymposium.org/acceptance-rates.php General Chairs Name: Gemma GaldÃşn Clavell Affiliation: Eticas Gender: F H Index: 10 GScholar url: https://scholar.google.ca/citations?user=n9ALpfAAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/130/9216.html Program Chairs Name: Damon McCoy Affiliation: NYC Gender: M H Index: 40 GScholar url: https://scholar.google.ca/citations?user=pT8-2f0AAAAJ&hl=en&oi=ao DBLP url: Name: Rachel Greenstadt Affiliation: NYU Gender: M H Index: 30 GScholar url: https://scholar.google.ca/citations?hl=en&user=FsbND-sAAAAJ DBLP url: https://dblp.org/pid/93/655.html Name: Carmela Tronosco Affiliation: EPFL Gender: F H Index: 27 GScholar url: https://scholar.google.ca/citations?user=sMkt3SgAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/01/4825.html Third Most Recent Year Year: 2017 URL: https://petsymposium.org/cfp17.php Location: Minneapolis Papers submitted: 229 Papers published: 52 Acceptance rate: 23 Source for numbers: https://petsymposium.org/acceptance-rates.php General Chairs 2 Name: Nick Hopper Affiliation: University of Minnesota Gender: M H Index: 38 GScholar url: https://scholar.google.ca/citations?user=4e2pnKYAAAAJ&hl=en&oi=sra DBLP url: Program Chairs Name: Rachel Greenstadt Affiliation: NYU Gender: F H Index: 30 GScholar url: https://scholar.google.ca/citations?hl=en&user=FsbND-sAAAAJ DBLP url: https://dblp.org/pid/93/655.html Name: Claudia Diaz Affiliation: KU Leuven Gender: F H Index: 34 GScholar url: https://scholar.google.com/citations?user=AUGbCSkAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/d/ClaudiaDiaz.html Policies Chair Selection: ”The PET Board is responsible for guiding PETS, including PoPETs, by selecting each year’s General Chair and the Program Co-Chairs (who also serve as the PoPETs Co-Editors-in-Chief), as well as overseeing the operations of both the symposium and the journal. The Co-Editors-in-Chief have the primary responsibility for their issues of PoPETs and the program of PETS.” Policy name: Code of Conduct Policy url: https://petsymposium.org/code-of-conduct.php Policy name: Review Policy Policy url: https://petsymposium.org/reviews.php#guidelines (Senior) Program Committee Link to (s)pc: https://petsymposium.org/cfp20.php File: http://portal.core.edu.au/core/media/conf_submissions_spc_file/popetspc H-index plot: http://portal.core.edu.au/core/media/conf_submissions_hindex_plots/hindex_buckets_1035.png Information Contained within this graph is derived using the Elsevier Scopus Database 2021. 3 Data and Metrics Google Scholar Metrics Sub-category url: https://scholar.google.com/citations?view_op=top_venues&hl=en&vq=eng_computersecuritycryptography Position in sub-category: 15 Image of top 20: http://portal.core.edu.au/core/media/changes_h5/higherrank1035_gscholar_minh5.png 4 h5-index for this conference: 35 ACM Metrics Not Sponsored by ACM Aminer Rank Not Listed in Aminer Other Rankings URL: http://jianying.space/conference-ranking.html Description: Quantitative ranking of academic security conferences based on ”Conference impact factor” Coheres closely with community expectations and matches CORE rankings for most conferences, as evidenced by the significant number of top people who contributed to the ranking system. Rank: 8 Conferences in area: IEEE S&P CCS USENIX PETS ESORICS SOUPS Top People Publishing Here name: Jean-Pierre Hubaux justification: Jean-Pierre Hubaux is a top researcher in wireless security and data privacy, with over 41, 000 citations. He has won an Distinguished Paper Award (2018) and Distinguished Student Paper Award (2015) from the IEEE Symposium on Security and Privacy. He is an IEEE and ACM Fellow. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 2 0 2 1 Attendance: SOMETIMES name: Ian Goldberg justification: Ian Goldberg is a top researcher in cryptography and computer security. He was awarded the USENIX Security Test of Time Award (2019), the Caspar Bowden Award for Outstanding Research in Privacy Enhancing Technologies (2018), and he won the EFF Pioneer Award (2011). He is an ACM Distinguished Member. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 1 3 0 4 Attendance: ALWAYS 5 name: Tadayoshi Kohno justification: Tadayoshi Kohno is a well-known researcher in security and privacy, with over 19, 000 citations. He is the recipient of a Sloan Research Fellowship, a U.S. National Science Foundation CAREER Award, and a Technology Review TR-35 Young Innovator Award. Kohno is also a member of the National Academies Forum on Cyber Resilience, the IEEE Center for Secure Design, and the USENIX Security Steering Committee. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 0 1 1 1 Attendance: OCCASIONALLY name: Bryan Ford justification: Bryan Ford is a top researcher in distributed systems. He won the ACM CCS Test of Time Award (2020), the IRTF Applied Networking Prize (2020), the IEEE S&P Distinguished Paper Award (2018), and an NSF CAREER Award. He served as Program Chair of USENIX ATC 2017 and is a member of the IETF and IRTF security and cryptography working groups. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 2 0 1 1 Attendance: SOMETIMES name: N. Asokan justification: N. Asokan is a top scholar in system security, with over 14, 000 citations. He is an ACM Fellow, and ACM Distinguished Member, an IEEE Fellow. In 2018, he won the ACM SIGSAC Outstanding Innovation Award. He has served as a member of the steering committee of the ACM Wireless Security conference, as an associate editor-in-chief of IEEE Security & Privacy Magazine, and as an associate editor of ACM Transactions on Information and Systems Security. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 1 1 1 0 Attendance: OCCASIONALLY name: Ahmad-Reza Sadeghi justification: Ahmad-Reza Sadeghi is a top researcher in computer security, with major contributions to mobile security, hardware-based security, and applied cryptography. He has over 22, 000 citations. He was Editor-In-Chief of IEEE Security and Privacy Magazine, and he served 5 years on the editorial board of the ACM Transactions on Information and System Security. In 2018 he received the ACM SIGSAC Outstanding Contributions Award. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 0 0 2 1 Attendance: OFTEN name: Nick Feamster justification: Nick Feamster is a top researcher in networking and security, with over 21, 000 citations. He received the Presidential Early Career Award for Scientists and Engineers (PECASE) for his contributions to cybersecurity, a Sloan Research Fellowship, the NSF CAREER award, the IRTF Applied Networking Research Prize, and the USENIX Test of Time Award. He is an ACM Fellow. Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 2 0 1 None Attendance: SOMETIMES name: Vern Paxson justification: Vern Paxson is a leader of the Internet measurement community, with over 64, 000 citations. He has won the IEEE S&P Test of Time Award (2020), the Internet Defense Prize (2017), the IEEE Internet Award (2015), the SIGCOMM Award (2011), the ACM Grace Murray Hopper Award (2007), and the SIGCOMM Test of Time Award (2006). He served as Chair of the Internet Research Task Force (2001âĂŞ2005) and was a co-founder of the Internet Measurement Conference.
Recommended publications
  • Intel X86 Considered Harmful
    Intel x86 considered harmful Joanna Rutkowska October 2015 Intel x86 considered harmful Version: 1.0 1 Contents 1 Introduction5 Trusted, Trustworthy, Secure?......................6 2 The BIOS and boot security8 BIOS as the root of trust. For everything................8 Bad SMM vs. Tails...........................9 How can the BIOS become malicious?.................9 Write-Protecting the flash chip..................... 10 Measuring the firmware: TPM and Static Root of Trust........ 11 A forgotten element: an immutable CRTM............... 12 Intel Boot Guard............................. 13 Problems maintaining long chains of trust............... 14 UEFI Secure Boot?........................... 15 Intel TXT to the rescue!......................... 15 The broken promise of Intel TXT.................... 16 Rescuing TXT: SMM sandboxing with STM.............. 18 The broken promise of an STM?.................... 19 Intel SGX: a next generation TXT?................... 20 Summary of x86 boot (in)security.................... 21 2 Intel x86 considered harmful Contents 3 The peripherals 23 Networking devices & subsystem as attack vectors........... 23 Networking devices as leaking apparatus................ 24 Sandboxing the networking devices................... 24 Keeping networking devices outside of the TCB............ 25 Preventing networking from leaking out data.............. 25 The USB as an attack vector...................... 26 The graphics subsystem......................... 29 The disk controller and storage subsystem............... 30 The audio
    [Show full text]
  • Consensgx: Scaling Anonymous Communications Networks With
    Proceedings on Privacy Enhancing Technologies ; 2019 (3):331–349 Sajin Sasy* and Ian Goldberg* ConsenSGX: Scaling Anonymous Communications Networks with Trusted Execution Environments Abstract: Anonymous communications networks enable 1 Introduction individuals to maintain their privacy online. The most popular such network is Tor, with about two million Privacy is an integral right of every individual in daily users; however, Tor is reaching limits of its scala- society [72]. With almost every day-to-day interaction bility. One of the main scalability bottlenecks of Tor and shifting towards using the internet as a medium, it similar network designs originates from the requirement becomes essential to ensure that we can maintain the of distributing a global view of the servers in the network privacy of our actions online. Furthermore, in light to all network clients. This requirement is in place to of nation-state surveillance and censorship, it is all avoid epistemic attacks, in which adversaries who know the more important that we enable individuals and which parts of the network certain clients do and do not organizations to communicate online without revealing know about can rule in or out those clients from being their identities. There are a number of tools aiming to responsible for particular network traffic. provide such private communication, the most popular In this work, we introduce a novel solution to this of which is the Tor network [21]. scalability problem by leveraging oblivious RAM con- Tor is used by millions of people every day to structions and trusted execution environments in order protect their privacy online [70].
    [Show full text]
  • Doswell, Stephen (2016) Measurement and Management of the Impact of Mobility on Low-Latency Anonymity Networks
    Citation: Doswell, Stephen (2016) Measurement and management of the impact of mobility on low-latency anonymity networks. Doctoral thesis, Northumbria University. This version was downloaded from Northumbria Research Link: http://nrl.northumbria.ac.uk/30242/ Northumbria University has developed Northumbria Research Link (NRL) to enable users to access the University’s research output. Copyright © and moral rights for items on NRL are retained by the individual author(s) and/or other copyright owners. Single copies of full items can be reproduced, displayed or performed, and given to third parties in any format or medium for personal research or study, educational, or not-for-profit purposes without prior permission or charge, provided the authors, title and full bibliographic details are given, as well as a hyperlink and/or URL to the original metadata page. The content must not be changed in any way. Full items must not be sold commercially in any format or medium without formal permission of the copyright holder. The full policy is available online: http://nrl.northumbria.ac.uk/policies.html MEASUREMENT AND MANAGEMENT OF THE IMPACT OF MOBILITY ON LOW-LATENCY ANONYMITY NETWORKS S.DOSWELL Ph.D 2016 Measurement and management of the impact of mobility on low-latency anonymity networks Stephen Doswell A thesis submitted in partial fulfilment of the requirements of the University of Northumbria at Newcastle for the degree of Doctor of Philosophy Research undertaken in the Department of Computer Science and Digital Technologies, Faculty of Engineering and Environment October 2016 Declaration I declare that the work contained in this thesis has not been submitted for any other award and that it is all my own work.
    [Show full text]
  • Threat Modeling and Circumvention of Internet Censorship by David Fifield
    Threat modeling and circumvention of Internet censorship By David Fifield A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate Division of the University of California, Berkeley Committee in charge: Professor J.D. Tygar, Chair Professor Deirdre Mulligan Professor Vern Paxson Fall 2017 1 Abstract Threat modeling and circumvention of Internet censorship by David Fifield Doctor of Philosophy in Computer Science University of California, Berkeley Professor J.D. Tygar, Chair Research on Internet censorship is hampered by poor models of censor behavior. Censor models guide the development of circumvention systems, so it is important to get them right. A censor model should be understood not just as a set of capabilities|such as the ability to monitor network traffic—but as a set of priorities constrained by resource limitations. My research addresses the twin themes of modeling and circumvention. With a grounding in empirical research, I build up an abstract model of the circumvention problem and examine how to adapt it to concrete censorship challenges. I describe the results of experiments on censors that probe their strengths and weaknesses; specifically, on the subject of active probing to discover proxy servers, and on delays in their reaction to changes in circumvention. I present two circumvention designs: domain fronting, which derives its resistance to blocking from the censor's reluctance to block other useful services; and Snowflake, based on quickly changing peer-to-peer proxy servers. I hope to change the perception that the circumvention problem is a cat-and-mouse game that affords only incremental and temporary advancements.
    [Show full text]
  • Changing of the Guards: a Framework for Understanding and Improving Entry Guard Selection in Tor
    Changing of the Guards: A Framework for Understanding and Improving Entry Guard Selection in Tor Tariq Elahi†, Kevin Bauer†, Mashael AlSabah†, Roger Dingledine‡, Ian Goldberg† †University of Waterloo ‡The Tor Project, Inc. †{mtelahi,k4bauer,malsabah,iang}@cs.uwaterloo.ca ‡[email protected] ABSTRACT parties with anonymity from their communication partners as well Tor is the most popular low-latency anonymity overlay network as from passive third parties observing the network. This is done for the Internet, protecting the privacy of hundreds of thousands by distributing trust over a series of Tor routers, which the network of people every day. To ensure a high level of security against cer- clients select to build paths to their Internet destinations. tain attacks, Tor currently utilizes special nodes called entry guards If the adversary can anticipate or compel clients to choose com- as each client’s long-term entry point into the anonymity network. promised routers then clients can lose their anonymity. Indeed, While the use of entry guards provides clear and well-studied secu- the client router selection protocol is a key ingredient in main- rity benefits, it is unclear how well the current entry guard design taining the anonymity properties that Tor provides and needs to achieves its security goals in practice. be secure against adversarial manipulation and leak no information We design and implement Changing of the Guards (COGS), a about clients’ selected routers. simulation-based research framework to study Tor’s entry guard de- When the Tor network was first launched in 2003, clients se- sign. Using COGS, we empirically demonstrate that natural, short- lected routers uniformly at random—an ideal scheme that provides term entry guard churn and explicit time-based entry guard rotation the highest amount of path entropy and thus the least amount of contribute to clients using more entry guards than they should, and information to the adversary.
    [Show full text]
  • Mass Surveillance
    Mass Surveillance Mass Surveillance What are the risks for the citizens and the opportunities for the European Information Society? What are the possible mitigation strategies? Part 1 - Risks and opportunities raised by the current generation of network services and applications Study IP/G/STOA/FWC-2013-1/LOT 9/C5/SC1 January 2015 PE 527.409 STOA - Science and Technology Options Assessment The STOA project “Mass Surveillance Part 1 – Risks, Opportunities and Mitigation Strategies” was carried out by TECNALIA Research and Investigation in Spain. AUTHORS Arkaitz Gamino Garcia Concepción Cortes Velasco Eider Iturbe Zamalloa Erkuden Rios Velasco Iñaki Eguía Elejabarrieta Javier Herrera Lotero Jason Mansell (Linguistic Review) José Javier Larrañeta Ibañez Stefan Schuster (Editor) The authors acknowledge and would like to thank the following experts for their contributions to this report: Prof. Nigel Smart, University of Bristol; Matteo E. Bonfanti PhD, Research Fellow in International Law and Security, Scuola Superiore Sant’Anna Pisa; Prof. Fred Piper, University of London; Caspar Bowden, independent privacy researcher; Maria Pilar Torres Bruna, Head of Cybersecurity, Everis Aerospace, Defense and Security; Prof. Kenny Paterson, University of London; Agustín Martin and Luis Hernández Encinas, Tenured Scientists, Department of Information Processing and Cryptography (Cryptology and Information Security Group), CSIC; Alessandro Zanasi, Zanasi & Partners; Fernando Acero, Expert on Open Source Software; Luigi Coppolino,Università degli Studi di Napoli; Marcello Antonucci, EZNESS srl; Rachel Oldroyd, Managing Editor of The Bureau of Investigative Journalism; Peter Kruse, Founder of CSIS Security Group A/S; Ryan Gallagher, investigative Reporter of The Intercept; Capitán Alberto Redondo, Guardia Civil; Prof. Bart Preneel, KU Leuven; Raoul Chiesa, Security Brokers SCpA, CyberDefcon Ltd.; Prof.
    [Show full text]
  • A Secure Environment for Untrusted Helper Applications (Confining the Wily Hacker)
    The following paper was originally published in the Proceedings of the Sixth USENIX UNIX Security Symposium San Jose, California, July 1996. A Secure Environment for Untrusted Helper Applications (Confining the Wily Hacker) Ian Goldberg, David Wagner, Randi Thomas, and Eric Brewer Computer Science Division University of California, Berkeley For more information about USENIX Association contact: 1. Phone: 510 528-8649 2. FAX: 510 548-5738 3. Email: [email protected] 4. WWW URL: http://www.usenix.org A Secure Environment for Untruste d Help er Applications Con ningtheWilyHacker Ian Goldb erg David Wagner Randi Thomas Er ic A. Brewer fiang,daw,randit,[email protected] University of California, Berkeley cious programs to spawn pro ce ss e s andto read or Ab stract wr iteanunsusp ecting us er's le s [15,18,19,34,36]. Whatisnee ded in thi s new environment, then, i s Manypopular programs, suchasNetscap e, us e un- protection for all re source s on a us er's system f rom trusted help er applications to pro ce ss data f rom the thi s threat. network. Unfortunately,theunauthenticated net- workdatathey interpret could well have b een cre- Our aim i s tocon netheuntrusted software anddata ated byanadversary,andthehelp er applications are by monitor ingand re str ictingthe system calls it p er- 1 usually to o complex to b e bug-f ree. Thi s rai s e s s ig- forms. We builtJanus , a s ecure environment for ni cant s ecur ity concer ns. Therefore, it i s de s irable untrusted help er applications, bytaking advantage to create a s ecure environmenttocontain untrusted of the Solar i s pro ce ss tracing f acility.
    [Show full text]
  • NSA) Surveillance Programmes (PRISM) and Foreign Intelligence Surveillance Act (FISA) Activities and Their Impact on EU Citizens' Fundamental Rights
    DIRECTORATE GENERAL FOR INTERNAL POLICIES POLICY DEPARTMENT C: CITIZENS' RIGHTS AND CONSTITUTIONAL AFFAIRS The US National Security Agency (NSA) surveillance programmes (PRISM) and Foreign Intelligence Surveillance Act (FISA) activities and their impact on EU citizens' fundamental rights NOTE Abstract In light of the recent PRISM-related revelations, this briefing note analyzes the impact of US surveillance programmes on European citizens’ rights. The note explores the scope of surveillance that can be carried out under the US FISA Amendment Act 2008, and related practices of the US authorities which have very strong implications for EU data sovereignty and the protection of European citizens’ rights. PE xxx.xxx EN AUTHOR(S) Mr Caspar BOWDEN (Independent Privacy Researcher) Introduction by Prof. Didier BIGO (King’s College London / Director of the Centre d’Etudes sur les Conflits, Liberté et Sécurité – CCLS, Paris, France). Copy-Editing: Dr. Amandine SCHERRER (Centre d’Etudes sur les Conflits, Liberté et Sécurité – CCLS, Paris, France) Bibliographical assistance : Wendy Grossman RESPONSIBLE ADMINISTRATOR Mr Alessandro DAVOLI Policy Department Citizens' Rights and Constitutional Affairs European Parliament B-1047 Brussels E-mail: [email protected] LINGUISTIC VERSIONS Original: EN ABOUT THE EDITOR To contact the Policy Department or to subscribe to its monthly newsletter please write to: [email protected] Manuscript completed in MMMMM 200X. Brussels, © European Parliament, 200X. This document is available on the Internet at: http://www.europarl.europa.eu/studies DISCLAIMER The opinions expressed in this document are the sole responsibility of the author and do not necessarily represent the official position of the European Parliament.
    [Show full text]
  • Effective Attacks and Provable Defenses for Website Fingerprinting
    Effective Attacks and Provable Defenses for Website Fingerprinting Tao Wang, University of Waterloo; Xiang Cai, Rishab Nithyanand, and Rob Johnson, Stony Brook University; Ian Goldberg, University of Waterloo https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/wang_tao This paper is included in the Proceedings of the 23rd USENIX Security Symposium. August 20–22, 2014 • San Diego, CA ISBN 978-1-931971-15-7 Open access to the Proceedings of the 23rd USENIX Security Symposium is sponsored by USENIX Effective Attacks and Provable Defenses for Website Fingerprinting Tao Wang1 Xiang Cai2 Rishab Nithyanand2 Rob Johnson2 Ian Goldberg1 1University of Waterloo 2Stony Brook University t55wang,iang @cs.uwaterloo.ca xcai,rnithyanand,rob @cs.stonybrook.edu { } { } Abstract When a client browses the web, she reveals her desti- Website fingerprinting attacks allow a local, passive nation and packet content to intermediate routers, which eavesdropper to identify a user’s web activity by lever- are controlled by ISPs who may be susceptible to ma- aging packet sequence information. These attacks break licious attackers, eavesdroppers, and legal pressure. To the privacy expected by users of privacy technologies, protect her web-browsing privacy, the client would need including low-latency anonymity networks such as Tor. to encrypt her communication traffic and obscure her In this paper, we show a new attack that achieves sig- destinations with a proxy such as Tor. Website finger- nificantly higher accuracy than previous attacks in the printing refers to the set of techniques that seek to re- same field, further highlighting website fingerprinting as identify these clients’ destination web pages by passively a genuine threat to web privacy.
    [Show full text]
  • D6.2 Altcoins – Alternatives to Bitcoin and Their Increasing Presence In
    Ref. Ares(2018)1599225 - 22/03/2018 RAMSES Internet Forensic platform for tracking the money flow of financially-motivated malware H2020 - 700326 D6.2 Altcoins: Alternatives to Bitcoin and their increasing presence in Malware-related Cybercrime Lead Authors: Darren Hurley-Smith (UNIKENT), Julio Hernandez-Castro (UNIKENT) With contributions from: Edward Cartwright (UNIKENT), Anna Stepanova (UNIKENT) Reviewers: Luis Javier Garcia Villalba (UCM) Deliverable nature: Report (R) Dissemination level: Public (PU) (Confidentiality) Contractual delivery date: 31/08/2017 Actual delivery date: 31/08/2017 Version: 1.0 Total number of pages: 36 Keywords: Cryptocurrency, altcoin, malware, darknet market, privacy Abstract Bitcoin is a relatively well-known cryptocurrency, a digital token representing value. It uses a blockchain, a distributed ledger formed of blocks which represent a network of computers agreeing that transactions have occurred, to provide a ledger of sorts. This technology is not unique to Bitcoin, many so-called ‘altcoins’ now exist. These alternative coins provide their own services, be it as a store of value with improved transactions (lower fees, higher speed), or additional privacy. Malware and Dark Net Market (DNM) operators have used Bitcoin to facilitate pseudo-anonymous extraction of value from their victims and customers. However, several high-profile arrests have been made using Bitcoin transaction graphing methods, proving that the emphasis is on the pseudo part of pseudo-anonymity. Altcoins specialising in masking the users’ identity – Monero, ZCash, and Dash – are therefore of interest as the next potential coins of choice for criminals. Ethereum, being the second largest crypto-currencies and imminently implementing its own privacy features, is also of interest.
    [Show full text]
  • Reloading Protection
    INFO 6 th INTERNATIONAL CONFERENCE T +32 2 629 20 93 • [email protected] 23 24 25 JANUARY 2013 l BRUSSELS BELGIUM COMPUTERS, PRIVACY DATES & DATA PROTECTION 23 24 25 January 2013 RELOADING LANGUAGE English DATA AUDIENCE PROTECTION Data protection authorities and offi cials, academics, civil liberties organisations, magistrates, barristers, legal consultants, lobbyists, representatives of ICT and security companies, etc. LOCATION www.nickvanhee.be © Les Halles de Schaerbeek (Grande Halle (6,237m2 - 750 seats), Petite Halle (380m2), and La Cave, Rue Royale-Sainte-Marie 22, 1030 Brussels side events De Markten: Oude Graanmarkt 5 Rue du Vieux Marché aux Grains, 1000 Brussels Bazar: Kapucijnenstraat 63 Rue des Capucins, 1000 Brussels WHAT’S GOING ON IN BRUSSELS AT THE MOMENT? www.agendamagazine.be www.brusselsmuseums.be www.visitbrussels.be www.europeanprivacyday.org WWW.CPDPCONFERENCES.ORG WWW.CPDPCONFERENCES.ORG CPDP2013_PROGRAMME_37.indd 48-49 21/01/13 21:07 CPDP CONFERENCE PARTNERS WHAT IS CPDP? Every year in Brussels, CPDP gathers policy makers, academics, computer scientists, consultants, practitioners and activists from all over the world to exchange ideas and discuss emerging issues in information technology, privacy, data protection and law. CPDP has been growing progressively since its inception in terms of speakers, participants and panels. Ambitions for CPDP 2013 are higher than ever, as it will stage more than 40 panels and workshops (with a stimulating mix of academics, practitioners, regulators and advocates), as well as multiple side events (such as open debates, PechaKucha talks and artistic interventions). CPDP will pay particular attention to high-level and innovative research, and four panels will be completely devoted to the presentations of outstanding junior and senior academics.
    [Show full text]
  • Deniable Key Exchanges for Secure Messaging
    Deniable Key Exchanges for Secure Messaging Nik Unger Ian Goldberg Cheriton School of Computer Science Cheriton School of Computer Science University of Waterloo, University of Waterloo, Waterloo, ON, Canada Waterloo, ON, Canada [email protected] [email protected] ABSTRACT the lack of security and privacy in our messaging tools and spurred In the wake of recent revelations of mass government surveillance, demand for better solutions [20]. A widespread weakness in cur- secure messaging protocols have come under renewed scrutiny. A rent secure messaging tools is the lack of strong deniability proper- widespread weakness of existing solutions is the lack of strong ties [28]. Deniable secure messaging schemes allow conversation deniability properties that allow users to plausibly deny sending participants to later plausibly deny sending messages, or even par- messages or participating in conversations if the security of their ticipating in a conversation, while still providing authentication to communications is later compromised. Deniable authenticated key the participants at the time of the conversation. This notion was exchanges (DAKEs), the cryptographic protocols responsible for popularized in the secure messaging context with the release of providing deniability in secure messaging applications, cannot cur- Off-the-Record Messaging (OTR) a decade ago [3]. Unfortunately, rently provide all desirable properties simultaneously. the OTR protocol is not well suited to modern settings such as mo- We introduce two new DAKEs with provable
    [Show full text]