research-article

Open access

Talek: Private Group Messaging with Hidden Access Patterns

Authors:

Elisaweta Masserova,

Thomas Anderson,

Arvind Krishnamurthy,

Bryan ParnoAuthors Info & Claims

ACSAC '20: Proceedings of the 36th Annual Computer Security Applications Conference

Pages 84 - 99

https://doi.org/10.1145/3427228.3427231

Published: 08 December 2020 Publication History

All formats PDF

Abstract

Talek is a private group messaging system that sends messages through potentially untrustworthy servers, while hiding both data content and the communication patterns among its users. Talek explores a new point in the design space of private messaging; it guarantees access sequence indistinguishability, which is among the strongest guarantees in the space, while assuming an anytrust threat model, which is only slightly weaker than the strongest threat model currently found in related work. Our results suggest that this is a pragmatic point in the design space, since it supports strong privacy and good performance: we demonstrate a 3-server Talek cluster that achieves throughput of 9,433 messages/second for 32,000 active users with 1.7-second end-to-end latency. To achieve its security goals without coordination between clients, Talek relies on information-theoretic private information retrieval. To achieve good performance and minimize server-side storage, Talek introduces new techniques and optimizations that may be of independent interest, e.g., a novel use of blocked cuckoo hashing and support for private notifications. The latter provide a private, efficient mechanism for users to learn, without polling, which logs have new messages.

References

[1]

2015. New Data Shows Mobile Data Consumption Skyrocketing Following Snapchat Discoverâ€™s Launch. techcrunch.com.

[2]

2016. Pond. github.com/agl/pond.

[3]

2016. Ubuntu IRC Logs. https://irclogs.ubuntu.com/.

[4]

2017. Ricochet: Anonymous peer-to-peer instant messaging. github.com/ricochet-im/ricochet.

[5]

2018. Keybase. https://keybase.io/.

[6]

2018. Signal Privacy Policy. whispersystems.org.

[7]

Carlos Aguilar-Melchor, Joris Barrier, Laurent Fousse, and Marc-Olivier Killijian. 2016. XPIR: Private information retrieval for everyone. Privacy Enhancing Technologies(2016).

[8]

Nikolaos Alexopoulos, Aggelos Kiayias, Riivo Talviste, and Thomas Zacharias. 2017. MCMix: Anonymous messaging via secure multiparty computation. In 26th USENIX Security Symposium. 1217–1234.

[9]

Sebastian Angel, Hao Chen, Kim Laine, and Srinath Setty. 2018. PIR with compressed queries and amortized query processing. In Symposium on Security and Privacy. IEEE.

[10]

Sebastian Angel and Srinath Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure. In Operating Systems Design and Implementation. USENIX.

[11]

Jean-Philippe Aumasson and Daniel J Bernstein. 2012. SipHash: a fast short-input PRF. In International Conference on Cryptology in India. Springer, 489–508.

[12]

Amos Beimel, Yuval Ishai, and Tal Malkin. 2000. Reducing the servers computation in private information retrieval: PIR with preprocessing. In Proceedings of the Annual International Cryptology Conference.

[13]

Mihir Bellare, Ran Canetti, and Hugo Krawczyk. 1996. Keying hash functions for message authentication. In Annual International Cryptology Conference. Springer.

[14]

Mihir Bellare, Anand Desai, David Pointcheval, and Phillip Rogaway. 1998. Relations among notions of security for public-key encryption schemes. In Annual International Cryptology Conference. Springer, 26–45.

[15]

Daniel J Bernstein, Tanja Lange, and Peter Schwabe. 2012. The security impact of a new cryptographic library. In International Conference on Cryptology and Information Security in Latin America. Springer, 159–176.

Digital Library

[16]

Alexandra Boldyreva, Vipul Goyal, and Virendra Kumar. 2008. Identity-based encryption with efficient revocation. In Proceedings of the 15th ACM conference on Computer and communications security. ACM, 417–426.

Digital Library

[17]

Dan Boneh and Matt Franklin. 2001. Identity-based encryption from the Weil pairing. In Annual International Cryptology Conference. Springer, 213–229.

[18]

Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 416–432.

[19]

Nikita Borisov, George Danezis, and Ian Goldberg. 2015. DP5: A Private Presence Service. Proceedings on Privacy Enhancing Technologies 2015, 2(2015), 4–24.

[20]

Justin Brickell and Vitaly Shmatikov. 2006. Efficient Anonymity-Preserving Data Collection. In International Conference on Knowledge Discovery and Data Mining. ACM.

[21]

Yan-Cheng Chang and Michael Mitzenmacher. 2005. Privacy preserving keyword searches on remote encrypted data. In International Conference on Applied Cryptography and Network Security. Springer, 442–455.

Digital Library

[22]

David Chaum. 1988. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1, 1 (1988), 65–75.

[23]

David Chaum, Farid Javani, Aniket Kate, Anna Krasnova, Joeri de Ruiter, and Alan T Sherman. 2017. cMix: Anonymization by High-Performance Scalable Mixing. In International Conference on Applied Cryptography and Network Security. Springer, 557–578.

[24]

David L Chaum. 1981. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Commun. ACM 24, 2 (1981), 84–90.

Digital Library

[25]

Xiaomeng Chen, Ning Ding, Abhilash Jindal, Y Charlie Hu, Maruti Gupta, and Rath Vannithamby. 2015. Smartphone energy drain in the wild: Analysis and implications. ACM SIGMETRICS Performance Evaluation Review 43, 1 (2015), 151–164.

Digital Library

[26]

Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private information retrieval. In Proceedings of IEEE 36th Annual Foundations of Computer Science. IEEE, 41–50.

[27]

Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. 1998. Private Information Retrieval. Journal of the ACM (JACM) 45, 6 (1998), 965–981.

Digital Library

[28]

Henry Corrigan-Gibbs, Dan Boneh, and David Mazières. 2015. Riposte: An Anonymous Messaging System Handling Millions of Users. In Symposium on Security and Privacy. IEEE.

[29]

Henry Corrigan-Gibbs and Bryan Ford. 2010. Dissent: Accountable Anonymous Group Messaging. In Proceedings of Computer and Communications Security. ACM.

Digital Library

[30]

Henry Corrigan-Gibbs and Dmitry Kogan. 2019. Private Information Retrieval with Sublinear Online Time. Cryptology ePrint Archive, Report 2019/1075.

[31]

Henry Corrigan-Gibbs, David Isaac Wolinsky, and Bryan Ford. 2013. Proactively Accountable Anonymous Messaging in Verdict. In USENIX Security.

[32]

George Danezis, Roger Dingledine, and Nick Mathewson. 2003. Mixminion: Design of a Type III Anonymous Remailer Protocol. In Symposium on Security and Privacy. IEEE.

[33]

George Danezis and Andrei Serjantov. 2004. Statistical Disclosure or Intersection Attacks on Anonymity Systems. In International Workshop on Information Hiding.

Digital Library

[34]

Daniel Demmler, Peter Rindal, Mike Rosulek, and Ni Trieu. 2018. PIR-PSI: Scaling Private Contact Discovery. IACR Cryptology ePrint Archive 2018 (2018), 579. https://eprint.iacr.org/2018/579

[35]

Casey Devet, Ian Goldberg, and Nadia Heninger. 2012. Optimally Robust Private Information Retrieval. In USENIX Security.

[36]

Martin Dietzfelbinger and Christoph Weidling. 2007. Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. Theoretical Computer Science 380, 1 (2007), 47–68.

Digital Library

[37]

Roger Dingledine, Nick Mathewson, and Paul Syverson. 2004. Tor: The Second-Generation Onion Router. Technical Report. DTIC Document.

Digital Library

[38]

Colin Dixon, Thomas E Anderson, and Arvind Krishnamurthy. 2008. Phalanx: Withstanding Multimillion-Node Botnets. In USENIX Symposium on Networked Systems Design and Implementation.

[39]

Cynthia Dwork. 2006. Differential Privacy. In Automata, languages and programming. 1–12.

[40]

Cynthia Dwork. 2008. Differential Privacy: A Survey of Results. In Theory and applications of models of computation. 1–19.

[41]

Anthony Ephremides, Jeffrey E Wieselthier, and Dennis J Baker. 1987. A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proc. IEEE 75, 1 (1987), 56–73.

[42]

Úlfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova. 2014. RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response. In Proceedings of the 2014 ACM SIGSAC conference on computer and communications security. ACM, 1054–1067.

Digital Library

[43]

Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012/144. https://eprint.iacr.org/2012/144.

[44]

Jun Furukawa and Kazue Sako. 2001. An Efficient Scheme for Proving a Shuffle. In Advances in Cryptology (CRYPTO 2001). 368–387.

[45]

Ian Goldberg. 2007. Improving the Robustness of Private Information Retrieval. In Security and Privacy (SP), 2007 IEEE Symposium on. IEEE, 131–148.

Digital Library

[46]

Oded Goldreich. 1987. Towards a Theory of Software Protection and Simulation by Oblivious RAMs. In Symposium on Theory of Computing. ACM.

Digital Library

[47]

Oded Goldreich and Rafail Ostrovsky. 1996. Software Protection and Simulation on Oblivious RAMs. Journal of the ACM (JACM) 43, 3 (1996), 431–473.

Digital Library

[48]

Philippe Golle and Ari Juels. 2004. Dining Cryptographers Revisited. In Advances in Cryptology (Eurocrypt 2004). 456–473.

[49]

Ceki Gülcü and Gene Tsudik. 1996. Mixing E-mail with Babel. In Network and Distributed System Security. ISOC.

[50]

Trinabh Gupta, Natacha Crooks, Whitney Mulhern, Srinath TV Setty, Lorenzo Alvisi, and Michael Walfish. 2016. Scalable and Private Media Consumption with Popcorn. In Symposium on Networked Systems Design and Implementation. USENIX. https://www.usenix.org/conference/nsdi16/technical-sessions/presentation/gupta-trinabh

[51]

Alejandro Hevia and Daniele Micciancio. 2008. An indistinguishability-based characterization of anonymous channels. In Privacy Enhancing Technologies Symposium. Springer, 24–43.

Digital Library

[52]

Jason I Hong and James A Landay. 2004. An Architecture for Privacy-Sensitive Ubiquitous Computing. In Proceedings of the 2nd International Conference on Mobile Systems, Applications, and Services. ACM, 177–189.

Digital Library

[53]

Mohammad Saiful Islam, Mehmet Kuzu, and Murat Kantarcioglu. 2012. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation. In NDSS, Vol. 20. 12.

[54]

Anja Jerichow, Jan Muller, Andreas Pfitzmann, Birgit Pfitzmann, and Michael Waidner. 1998. Real-time Mixes: A Bandwidth-Efficient Anonymity Protocol. Selected Areas in Communications, IEEE Journal on 16, 4(1998), 495–509.

[55]

Nicholas Jones, Matvey Arye, Jacopo Cesareo, and Michael J Freedman. 2011. Hiding Amongst the Clouds: A Proposal for Cloud-based Onion Routing. In FOCI.

[56]

Dogan Kedogan, Dakshi Agrawal, and Stefan Penz. 2002. Limits of Anonymity in Open Environments. In International Workshop on Information Hiding. 53–69.

[57]

Eyal Kushilevitz and Rafail Ostrovsky. 1997. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science. IEEE, 364–373.

[58]

Albert Kwon, Henry Corrigan-Gibbs, Srinivas Devadas, and Bryan Ford. 2017. Atom: Horizontally scaling strong anonymity. In Proceedings of the 26th Symposium on Operating Systems Principles. ACM, 406–422.

Digital Library

[59]

Albert Kwon, David Lu, and Srinivas Devadas. 2020. XRD: Scalable Messaging System with Cryptographic Privacy. In To appear in Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI).

[60]

Young Hyun Kwon, David Lazar, Srinivas Devadas, and Bryan Ford. 2016. Riffle: An Efficient Communication System with Strong Anonymity. In Proceedings on Privacy Enhancing Technologies.

[61]

David Lazar, Yossi Gilad, and Nickolai Zeldovich. 2018. Karaoke: Distributed private messaging immune to passive traffic analysis. In Proceedings of USENIX Symposium on Operating Systems Design and Implementation (OSDI). 711–725.

[62]

David Lazar and Nickolai Zeldovich. 2016. Alpenhorn: Bootstrapping secure communication without leaking metadata. In Operating Systems Design and Implementation. USENIX.

[63]

Sarah Jamie Lewis. 2018. Cwtch: Privacy Preserving Infrastructure for Asynchronous, Decentralized, Multi-Party and Metadata Resistant Applications. https://cwtch.im/.

[64]

Jinyuan Li, Maxwell Krohn, David Mazieres, and Dennis Shasha. 2004. SUNDR: Secure Untrusted Data Repository. In USENIX Symposium on Operating Systems Design and Implementation.

[65]

Wouter Lueks and Ian Goldberg. 2015. Sublinear Scaling for Multi-Client Private Information Retrieval. In International Conference on Financial Cryptography and Data Security. 168–186.

[66]

Prince Mahajan, Srinath Setty, Sangmin Lee, Allen Clement, Lorenzo Alvisi, Mike Dahlin, and Michael Walfish. 2011. Depot: Cloud Storage with Minimal Trust. ACM Transactions on Computer Systems (TOCS) 29, 4 (2011), 12.

Digital Library

[67]

Nick Mathewson and Roger Dingledine. 2004. Practical Traffic Analysis: Extending and Resisting Statistical Disclosure. In Privacy Enhancing Technologies.

[68]

Susan E McGregor, Polina Charters, Tobin Holliday, and Franziska Roesner. 2015. Investigating the Computer Security Practices and Needs of Journalists. In USENIX Security.

[69]

Susan E McGregor, Franziska Roesner, and Kelly Caine. 2016. Individual versus Organizational Computer Security and Privacy Concerns in Journalism. Privacy Enhancing Technologies(2016).

[70]

Michael Mitzenmacher. 2002. Compressed bloom filters. Transactions on Networking(2002).

[71]

C Andrew Neff. 2003. Verifiable Mixing (Shuffling) of ElGamal Pairs. http://www.votehere.net/vhti/documentation/egshuf.pdf. VHTi Technical Document, VoteHere, Inc(2003).

[72]

Rafail Ostrovsky. 1990. Efficient Computation on Oblivious RAMs. In Symposium on Theory of Computing. ACM.

[73]

Rafail Ostrovsky and Victor Shoup. 1997. Private Information Storage. In Symposium on Theory of Computing. ACM. https://doi.org/10.1145/258533.258606

Digital Library

[74]

Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo Hashing. In European Symposium on Algorithms. 121–133.

[75]

Andreas Pfitzmann and Marit Hansen. 2010. A terminology for talking about privacy by data minimization: Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management (Version 0.34). https://dud.inf.tu-dresden.de/literatur/Anon_Terminology_v0.34.pdf.

[76]

Ania M Piotrowska, Jamie Hayes, Tariq Elahi, Sebastian Meiser, and George Danezis. 2017. The Loopix anonymity system. In 26th USENIX Security Symposium. 1199–1216.

[77]

Michael G Reed, Paul F Syverson, and David M Goldschlag. 1998. Anonymous Connections and Onion Routing. Selected Areas in Communications(1998).

[78]

Ronald L Rivest, Adi Shamir, and Leonard Adleman. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (1978).

[79]

Len Sassaman, Bram Cohen, and Nick Mathewson. 2005. The Pynchon Gate: A Secure Method of Pseudonymous Mail Retrieval. In Workshop on Privacy in the Electronic Society. ACM.

Digital Library

[80]

SEAL 2018. Simple Encrypted Arithmetic Library (release 3.1.0). https://github.com/Microsoft/SEAL. Microsoft Research, Redmond, WA.

[81]

Emin Gün Sirer, Sharad Goel, Mark Robson, and DoÇ§an Engin. 2004. Eluding Carnivores: File Sharing with Strong Anonymity. In Workshop on ACM SIGOPS European Workshop. ACM, 19.

Digital Library

[82]

Emil Stefanov and Elaine Shi. 2013. Multi-Cloud Oblivious Storage. In SIGSAC conference on Computer & Communications security. ACM.

[83]

Emil Stefanov and Elaine Shi. 2013. ObliviStore: High Performance Oblivious Cloud Storage. In Security and Privacy. IEEE.

[84]

Emil Stefanov, Marten Van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. 2013. Path ORAM: an Extremely Simple Oblivious RAM Protocol. In SIGSAC Conference on Computer & Communications Security. ACM.

Digital Library

[85]

Latanya Sweeney. 2002. k-anonymity: A Model for Protecting Privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 10, 05 (2002), 557–570.

Digital Library

[86]

Anna Tobin. 2018. These Were The Most Downloaded And Profitable Games and Apps Of 2018. https://www.forbes.com/sites/annatobin/2018/12/21/these-were-the-most-downloaded-and-profitable-games-and-apps-of-2018/.

[87]

Nirvan Tyagi, Yossi Gilad, Derek Leung, Matei Zaharia, and Nickolai Zeldovich. 2017. Stadium: A Distributed Metadata-Private Messaging System. In Proceedings of the 26th Symposium on Operating Systems Principles. ACM, 423–440.

Digital Library

[88]

Nik Unger, Sergej Dechand, Joseph Bonneau, Sascha Fahl, Henning Perl, Ian Goldberg, and Matthew Smith. 2015. SoK: Secure Messaging. In Security and Privacy. IEEE.

[89]

Jelle Van Den Hooff, David Lazar, Matei Zaharia, and Nickolai Zeldovich. 2015. Vuvuzela: Scalable Private Messaging Resistant to Traffic Analysis. In Symposium on Operating Systems Principles. ACM.

Digital Library

[90]

David Isaac Wolinsky, Henry Corrigan-Gibbs, Bryan Ford, and Aaron Johnson. 2012. Dissent in Numbers: Making Strong Anonymity Scale. In Operating Systems Design and Implementation. USENIX.

[91]

David Isaac Wolinsky, Henry Corrigan-Gibbs, Bryan Ford, and Aaron Johnson. 2012. Scalable anonymous group communication in the anytrust model. In Proceedings of the European Workshop on System Security (EuroSec).

Cited By

Kocaoğullar CHugenroth DKleppmann MBeresford A(2024)Pudding: Private User Discovery in Anonymity Networks2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00167(3203-3220)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00167
Watson JDespres TTan APatil SDutta PPopa R(2024)Nebula: A Privacy-First Platform for Data Backhaul2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00092(3184-3202)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00092
Liu SChen LFu Y(2024)Periscoping: Private Key Distribution for Large-Scale MixnetsIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621274(681-690)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621274
Show More Cited By

Index Terms

Talek: Private Group Messaging with Hidden Access Patterns

Index terms have been assigned to the content through auto-classification.

Recommendations

Riposte: An Anonymous Messaging System Handling Millions of Users
SP '15: Proceedings of the 2015 IEEE Symposium on Security and Privacy

This paper presents Riposte, a new system for anonymous broadcast messaging. Riposte is the first such system, to our knowledge, that simultaneously protects against traffic-analysis attacks, prevents anonymous denial-of-service by malicious clients, ...
Private web search
WPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society

Web search is currently a source of growing concern about personal privacy. It is an essential and central part of most users' activity online and therefore one through which a significant amount of personal information may be revealed.To help users ...
Private Anonymous Messaging
SRDS '12: Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed Systems

Messaging systems where a user maintains a set of contacts and broadcasts messages to them is very common. We address the problem of a contact obtaining a message that it missed, from other contacts of the user while maintaining anonymity of all parties ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ACSAC '20: Proceedings of the 36th Annual Computer Security Applications Conference

December 2020

962 pages

ISBN:9781450388580

DOI:10.1145/3427228

Copyright © 2020 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 December 2020

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Conference

ACSAC '20

ACSAC '20: Annual Computer Security Applications Conference

December 7 - 11, 2020

Austin, USA

Acceptance Rates

Overall Acceptance Rate 104 of 497 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
957
Total Downloads

Downloads (Last 12 months)245
Downloads (Last 6 weeks)21

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Kocaoğullar CHugenroth DKleppmann MBeresford A(2024)Pudding: Private User Discovery in Anonymity Networks2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00167(3203-3220)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00167
Watson JDespres TTan APatil SDutta PPopa R(2024)Nebula: A Privacy-First Platform for Data Backhaul2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00092(3184-3202)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00092
Liu SChen LFu Y(2024)Periscoping: Private Key Distribution for Large-Scale MixnetsIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621274(681-690)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621274
Nelson BPagnin EAskarov A(2024)Metadata Privacy Beyond Tunneling for Instant Messaging2024 IEEE 9th European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP60621.2024.00044(697-723)Online publication date: 8-Jul-2024
https://doi.org/10.1109/EuroSP60621.2024.00044
Zhang WShang SWang HCai ZZhao YLi X(2024)VPIR: an efficient verifiable private information retrieval scheme resisting malicious cloud serverTelecommunication Systems10.1007/s11235-024-01162-186:4(743-755)Online publication date: 28-May-2024
https://doi.org/10.1007/s11235-024-01162-1
Coijanovic CStark ASchadt DStrufe T(2024)Pirates: Anonymous Group Calls over Fully Untrusted InfrastructureInformation Security and Privacy10.1007/978-981-97-5101-3_11(193-212)Online publication date: 15-Jul-2024
https://doi.org/10.1007/978-981-97-5101-3_11
Dietz MTessaro S(2024)Fully Malicious Authenticated PIRAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_4(113-147)Online publication date: 18-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68400-5_4
Hugenroth DBeresford ACalandrino JTroncoso C(2023)Powering privacyProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620541(5431-5448)Online publication date: 9-Aug-2023
https://dl.acm.org/doi/10.5555/3620237.3620541
Papadopoulos PPachilakis MChariton AMarkatos ELindorfer MPolakis J(2022)OUTOPIAProceedings of the 15th European Workshop on Systems Security10.1145/3517208.3523756(8-14)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1145/3517208.3523756
Bowers ADu JLin DJiang WSuga YSakurai KDing XSako K(2022)Easy-to-Implement Two-Server based Anonymous Communication with Simulation SecurityProceedings of the 2022 ACM on Asia Conference on Computer and Communications Security10.1145/3488932.3523264(831-842)Online publication date: 30-May-2022
https://dl.acm.org/doi/10.1145/3488932.3523264
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents