Zobrazeno 1 - 10
of 167
pro vyhledávání: '"Wei-kai Lin"'
Publikováno v:
Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-70, 70p
Publikováno v:
In Journal of the Formosan Medical Association January 2019 118(1) Part 3:457-462
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457235
EUROCRYPT (2)
Advances in Cryptology – EUROCRYPT 2020
EUROCRYPT (2)
Advances in Cryptology – EUROCRYPT 2020
Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC ’87 and J. ACM ’96) is a technique for provably obfuscating programs’ access patterns, such that the access patterns leak no information about t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f83a37b9e947c7aaaa895751f5a1c28
https://doi.org/10.1145/3566049
https://doi.org/10.1145/3566049
Publikováno v:
Proceedings of the 55th Annual ACM Symposium on Theory of Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad434605f53a18a5b5a653658913a11b
https://doi.org/10.1145/3564246.3585175
https://doi.org/10.1145/3564246.3585175
Publikováno v:
Journal of Cryptology. 36
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a4caf4467effcb206c24d8f22868016
https://doi.org/10.1007/s00145-023-09447-5
https://doi.org/10.1007/s00145-023-09447-5
Publikováno v:
2023 IEEE International Conference on Big Data and Smart Computing (BigComp).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f7f3e0c5c97c4b7531a8464b9231d47
https://doi.org/10.1109/bigcomp57234.2023.00046
https://doi.org/10.1109/bigcomp57234.2023.00046
Publikováno v:
Advances in Cryptology – EUROCRYPT 2023 ISBN: 9783031305443
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56f6a238831169daa03e760a407b7aae
https://doi.org/10.1007/978-3-031-30545-0_14
https://doi.org/10.1007/978-3-031-30545-0_14
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
CRYPTO (4)
We present the first Oblivious RAM (ORAM) construction that for N memory blocks supports accesses with worst-case \(O(\log N)\) overhead for any block size \(\varOmega (\log N)\) while requiring a client memory of only a constant number of memory blo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8adee8bc35481397a6898102046a73ce
https://doi.org/10.1007/978-3-030-84259-8_21
https://doi.org/10.1007/978-3-030-84259-8_21