default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Milner 0002
Person information
- affiliation: Quantinuum, Cambridge, UK
Other persons with the same name
- Kevin Milner 0001
![[0000-0002-9118-6378]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9118-6378")
— United States Geological Survey, Pasadena, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i6]Cameron Foreman, Lewis Wooltorton, Kevin Milner, Florian J. Curchod:
An efficient construction of Raz's two-source randomness extractor with improved parameters. CoRR abs/2506.15547 (2025)- [i5]Cameron Foreman, Lewis Wooltorton, Kevin Milner, Florian J. Curchod:
An efficient construction of Raz's two-source randomness extractor with improved parameters. IACR Cryptol. ePrint Arch. 2025: 1156 (2025)
2010 – 2019
- 2019
- [j3]Cas Cremers, Martin Dehnel-Wild, Kevin Milner:
Secure authentication in the grid: A formal analysis of DNP3 SAv5. J. Comput. Secur. 27(2): 203-232 (2019) - 2018
- [b1]Kevin Milner:
Detecting the misuse of secrets: foundations, protocols, and verification. University of Oxford, UK, 2018 - [c4]Katriel Cohn-Gordon, Cas Cremers, Luke Garratt, Jon Millican, Kevin Milner:
On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees. CCS 2018: 1802-1819 - 2017
- [c3]Kevin Milner, Cas Cremers, Jiangshan Yu, Mark Ryan:
Automatically Detecting the Misuse of Secrets: Foundations, Design Principles, and Applications. CSF 2017: 203-216 - [c2]Cas Cremers, Martin Dehnel-Wild, Kevin Milner:
Secure Authentication in the Grid: A Formal Analysis of DNP3: SAv5. ESORICS (1) 2017: 389-407 - [i4]Kevin Milner, Cas Cremers, Jiangshan Yu, Mark Ryan:
Automatically Detecting the Misuse of Secrets: Foundations, Design Principles, and Applications. IACR Cryptol. ePrint Arch. 2017: 234 (2017) - [i3]Katriel Cohn-Gordon, Cas Cremers, Luke Garratt, Jon Millican, Kevin Milner:
On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees. IACR Cryptol. ePrint Arch. 2017: 666 (2017) - 2015
- [j2]Gus Gutoski, Patrick M. Hayden, Kevin Milner, Mark M. Wilde:
Quantum Interactive Proofs and the Complexity of Separability Testing. Theory Comput. 11: 59-103 (2015) - 2014
- [j1]Patrick M. Hayden, Kevin Milner, Mark M. Wilde:
Two-message quantum interactive proofs and the quantum separability problem. Quantum Inf. Comput. 14(5-6): 384-416 (2014) - 2013
- [c1]Patrick M. Hayden, Kevin Milner, Mark M. Wilde:
Two-Message Quantum Interactive Proofs and the Quantum Separability Problem. CCC 2013: 156-167 - [i2]Kevin Milner, Gus Gutoski, Patrick M. Hayden, Mark M. Wilde:
Quantum interactive proofs and the complexity of entanglement detection. CoRR abs/1308.5788 (2013) - 2012
- [i1]Patrick M. Hayden, Kevin Milner, Mark M. Wilde:
Two-message quantum interactive proofs and the quantum separability problem. CoRR abs/1211.6120 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-04-01 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
