Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Ioannis Demertzis"'
Publikováno v:
SOSP
Existing oblivious storage systems provide strong security by hiding access patterns, but do not scale to sustain high throughput as they rely on a central point of coordination. To overcome this scalability bottleneck, we present Snoopy, an object s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d0d1f2d3bfae5cf62791467db6eafb5
https://doi.org/10.1145/3477132.3483562
https://doi.org/10.1145/3477132.3483562
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b6e64f9183ff58a5fdc8cf0e5832dc4
https://doi.org/10.14778/3236187.3236218
https://doi.org/10.14778/3236187.3236218
Autor:
Charalampos Papamanthou, Stavros Papadopoulos, Ioannis Demertzis, Odysseas Papapetrou, Minos Garofalakis, Antonios Deligiannakis
Publikováno v:
ACM Transactions on Database Systems
We consider a data owner that outsources its dataset to an untrusted server . The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are several schemes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbb05979a673bb6744b93118ef6d39be
https://doi.org/10.1145/3167971
https://doi.org/10.1145/3167971
Publikováno v:
NDSS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54a8178fab442d05c9229d6e62142f79
https://doi.org/10.14722/ndss.2020.24423
https://doi.org/10.14722/ndss.2020.24423
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319968834
CRYPTO (1)
CRYPTO (1)
We propose the first linear-space searchable encryption scheme with constant locality and sublogarithmic read efficiency, strictly improving the previously best known read efficiency bound (Asharov et al., STOC 2016) from \(\varTheta (\log N \log \lo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4968ec4e8d6621dca2df912eaf3390de
https://doi.org/10.1007/978-3-319-96884-1_13
https://doi.org/10.1007/978-3-319-96884-1_13
Publikováno v:
SIGMOD Conference
Searchable encryption (SE) allows a client to outsource a dataset to an untrusted server while enabling the server to answer keyword queries in a private manner. SE can be used as a building block to support more expressive private queries such as ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aac84d6f9f1d85a977d22f8ad3fdaa97
https://doi.org/10.1145/3035918.3064057
https://doi.org/10.1145/3035918.3064057
Autor:
Stavros Papadopoulos, Ioannis Demertzis, Odysseas Papapetrou, Minos Garofalakis, Antonios Deligiannakis
Publikováno v:
SIGMOD Conference
Summarization: We consider a data owner that outsources its dataset to an untrusted server. The owner wishes to enable the server to answer range queries on a single attribute, without compromising the privacy of the data and the queries. There are s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d0b19fa7bc504520d321595b334acaa
https://doi.org/10.1145/2882903.2882911
https://doi.org/10.1145/2882903.2882911