Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Charalampos Papamanthou"'
Autor:
Shravan Srinivasan, Julian Loss, Giulio Malavolta, Kartik Nayak, Charalampos Papamanthou, Sri AravindaKrishnan Thyagarajan
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031313677
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f68115749306a49095d920863cd4076
https://doi.org/10.1007/978-3-031-31368-4_20
https://doi.org/10.1007/978-3-031-31368-4_20
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Publikováno v:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security.
Publikováno v:
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159817
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7d25ed558ba3da5d7c2cebadd5c3a10
https://doi.org/10.1007/978-3-031-15982-4_15
https://doi.org/10.1007/978-3-031-15982-4_15
Publikováno v:
IEEE Symposium on Security and Privacy
Despite a growing body of work on leakage-abuse attacks for encrypted databases, attacks on practical response-hiding constructions are yet to appear. Response-hiding constructions are superior in that they nullify access-pattern based attacks by rev
Autor:
Brice Minaud, Charalampos Papamanthou
Cuckoo hashing is a common hashing technique, guaranteeing constant-time lookups in the worst case. Adding a stash was proposed by Kirsch, Mitzenmacher, and Wieder at SICOMP 2010, as a way to reduce the probability of failure (i.e., the probability t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea5d7f473ddeeef392b0864bab170605
http://arxiv.org/abs/2010.01890
http://arxiv.org/abs/2010.01890
Publikováno v:
IEEE Symposium on Security and Privacy
Recent foundational work on leakage-abuse attacks on encrypted databases has broadened our understanding of what an adversary can accomplish with a standard leakage profile. Nevertheless, all known value reconstruction attacks succeed under strong as
Publikováno v:
ACM Transactions on Privacy and Security. 21:1-23
We consider a scenario in which a data owner outsources storage of a large graph to an untrusted server; the server performs computations on this graph in response to queries from a client (whether the data owner or others), and the goal is to ensure
Publikováno v:
Journal of Cryptology. 32:941-972
Oblivious RAM (ORAM) is a cryptographic primitive that allows a trusted CPU to securely access untrusted memory, such that the access patterns reveal nothing about sensitive data. ORAM is known to have broad applications in secure processor design an
Publikováno v:
Proceedings of the VLDB Endowment. 11:1729-1741
In this work we design new searchable encryption schemes whose goal is to minimize the number of cryptographic operations required to retrieve the result---a dimension mostly overlooked by previous works, yet very important in practice. Our main idea