Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jonathan Hoyland"'
Autor:
Sudheesh Singanamalla, Muhammad Talha Paracha, Suleman Ahmad, Jonathan Hoyland, Luke Valenta, Yevgen Safronov, Peter Wu, Andrew Galloni, Kurtis Heimerl, Nick Sullivan, Christopher A. Wood, Marwan Fayed
Publikováno v:
Proceedings of the 22nd ACM Internet Measurement Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ed48d122a668981319ca9d404dd4279
https://doi.org/10.1145/3517745.3561453
https://doi.org/10.1145/3517745.3561453
Autor:
Christopher A. Wood, Peter Wu, Marwan Fayed, Kurtis Heimerl, Nick Sullivan, Marek Vavrusa, Sudheesh Singanamalla, Tanya Verma, Jonathan Hoyland, Suphanat Chunhapanya
Publikováno v:
Proceedings on Privacy Enhancing Technologies, Vol 2021, Iss 4, Pp 575-592 (2021)
The Internet’s Domain Name System (DNS) responds to client hostname queries with corresponding IP addresses and records. Traditional DNS is unencrypted and leaks user information to on-lookers. Recent efforts to secure DNS using DNS over TLS (DoT)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef7eb0f20b5f093757d64b2f267993ab
https://doi.org/10.2478/popets-2021-0085
https://doi.org/10.2478/popets-2021-0085
Publikováno v:
Computer Security – ESORICS 2022 ISBN: 9783031171420
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5035e242d9e28c97cce390b72ad15024
https://doi.org/10.1007/978-3-031-17143-7_4
https://doi.org/10.1007/978-3-031-17143-7_4
Publikováno v:
CCS'17
CCS
CCS
The TLS protocol is intended to enable secure end-to-end communication over insecure networks, including the Internet. Unfortunately, this goal has been thwarted a number of times throughout the protocol's tumultuous lifetime, resulting in the need f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b666ffc36947f1ff07f852af1d92f2c
https://hdl.handle.net/21.11116/0000-0000-6E64-5
https://hdl.handle.net/21.11116/0000-0000-6E64-5
Autor:
Jonathan Hoyland, Matthew Hague
Publikováno v:
FTfJP@ECOOP
This article introduces ATAB, a tool that automatically generates pairwise reachability checks for action trees. Action trees can be used to study the behaviour of real-world concurrent programs. ATAB encodes pairwise reachability checks into alterna
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bb36215500d0bfc494858c9f5fa398d
https://doi.org/10.1145/2955811.2955815
https://doi.org/10.1145/2955811.2955815