TY - CHAP A1 - Panchenko, Andriy A1 - Lanze, Fabian A1 - Zinnen, Andreas A1 - Henze, Martin A1 - Pennekamp, Jan A1 - Engel, Thomas A1 - Wehrle, Klaus T1 - Website Fingerprinting at Internet Scale T2 - Proceedings of the 23rd Internet Society (ISOC) Network and Distributed System Security Symposium (NDSS 2016), San Diego, USA, February 2016 Y1 - 2016 SN - 1-891562-41-X PB - Internet Society CY - Reston, VA ER - TY - GEN A1 - Mitseva, Asya A1 - Panchenko, Andriy A1 - Lanze, Fabian A1 - Henze, Martin A1 - Engel, Thomas A1 - Wehrle, Klaus T1 - POSTER: Fingerprinting Tor Hidden Services T2 - In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS '16). Association for Computing Machinery, New York, NY, USA Y1 - 2016 SN - 978-1-4503-4139-4 U6 - https://doi.org/10.1145/2976749.2989054 SP - 1766 EP - 1768 PB - ACM CY - New York ER - TY - GEN A1 - Backes, Michael A1 - Herzberg, Amir A1 - Kate, Aniket A1 - Pryvalov, Ivan T1 - Differentially private data aggregation with optimal utility T2 - Proceedings of the 30th Annual Computer Security Applications Conference, ACSAC 2014, New Orleans, LA, USA, December 8-12, 2014 N2 - We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user’s identity, from curious servers and from other (even adversarial) users. AnonRAM further protects integrity, i.e., it prevents malicious users from corrupting data of other users. We present two secure AnonRAM schemes, differing in design and time complexity. The first scheme has a simpler design; like efficient ORAM schemes, its time complexity is poly-logarithmic in the number of cells (per user); however, it is linear in the number of users. The second AnonRAM scheme reduces the overall complexity to poly-logarithmic in the total number of cells (of all users) at the cost of requiring two (non-colluding) servers. KW - Anonymity KW - Access privacy KW - Oblivious RAM KW - Out-sourced data KW - (Universal) Re-randomizable encryption KW - Oblivious PRF Y1 - 2016 UR - https://link.springer.com/chapter/10.1007/978-3-319-45744-4_17 U6 - https://doi.org/10.1145/2664243.2664263 SP - 316 EP - 325 PB - Springer ER -