Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dominic Mayers

dblp:13/2012 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5 · 2 first-authorTheory of computation · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic protocols and secure computation · 71% Cryptographic primitives and cryptanalysis · 29%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 67% Electronic design automation · 33%
Theoretical computer science
1 paper
Quantum computing and quantum information · 100%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › key distribution
quantum key distribution
0.142001
Unconditional security in quantum cryptography · J. ACM 2001
Quantum Cryptography with Imperfect Apparatus · FOCS 1998
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels · CRYPTO 1996
Electronic design automation › hardware verification and test › design for testability
built-in self-test
0.112006
Self-testing of Quantum Circuits · ICALP (1) 2006
Emerging computing paradigms › quantum computer architecture
quantum circuit testing
0.112006
Self-testing of Quantum Circuits · ICALP (1) 2006
Emerging computing paradigms
quantum computer architecture
0.112006
Self-testing of Quantum Circuits · ICALP (1) 2006
Cryptographic protocols and secure computation
key exchange
0.012001
Unconditional security in quantum cryptography · J. ACM 2001
Cryptographic primitives and cryptanalysis › information-theoretic security
unconditional security
0.012001
Unconditional security in quantum cryptography · J. ACM 2001
Cryptographic primitives and cryptanalysis
quantum cryptography
0.021996
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels · CRYPTO 1996
On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols · CRYPTO 1995
Cryptographic protocols and secure computation › commitment schemes
bit commitment
0.012000
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation · EUROCRYPT 2000
Cryptographic protocols and secure computation › commitment schemes › bit commitment
quantum bit commitment
0.012000
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation · EUROCRYPT 2000
Cryptographic primitives and cryptanalysis › quantum cryptography › quantum-secure communication › quantum cryptographic protocols
device-independent security
0.011998
Quantum Cryptography with Imperfect Apparatus · FOCS 1998
Quantum computing and quantum information
quantum cryptography
0.011998
Quantum Cryptography with Imperfect Apparatus · FOCS 1998
Cryptographic protocols and secure computation
oblivious transfer
0.011996
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels · CRYPTO 1996
Cryptographic protocols and secure computation › oblivious transfer
quantum oblivious transfer
0.011995
On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols · CRYPTO 1995
Cryptographic protocols and secure computation
noisy channels
0.011996
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels · CRYPTO 1996

Methods — techniques the papers use, named apart from their topics

quantum information theory · 0.1structural theorem · 0.0security proof · 0.0EPR pairs · 0.0EPR pair · 0.0quantum security analysis · 0.0
YearPublicationVenuePosition
2006 Self-testing of Quantum Circuits
Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
ICALP (1)2
2005 The Universal Composable Security of Quantum Key Distribution
Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, Jonathan Oppenheim
TCC4
2004 Computational Collapse of Quantum State with Application to Oblivious Transfer
Claude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail
TCC3
2001 Unconditional security in quantum cryptography
abstract
Basic techniques to prove the unconditional security of quantum crypto graphy are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard [1984]. The proof considers a practical variation on the protocol in which the channel is noisy and photos may be lost during the transmission. Each individual signal sent into the channel must contain a single photon or any two-dimensional system in the exact state described in the protocol. No restriction is imposed on the detector used at the receiving side of the channel, except that whether or not the received system is detected must be independent of the basis used to measure this system.
Dominic Mayers
J. ACM1
2000 Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
Paul Dumais, Dominic Mayers, Louis Salvail
EUROCRYPT2
1998 Quantum Cryptography with Imperfect Apparatus
abstract
Quantum key distribution, first proposed by C.H. Bennett and G. Brassard (1984), provides a possible key distribution scheme whose security depends only on the quantum laws of physics. So far the protocol has been proved secure even under channel noise and detector faults of the receiver but is vulnerable if the photon source used is imperfect. In this paper we propose and give a concrete design for a new concept, self-checking source, which requires the manufacturer of the photon source to provide certain tests; these tests are designed such that, if passed, the source is guaranteed to be adequate for the security of the quantum key distribution protocol, even though the testing devices may not be built to the original specification. The main mathematical result is a structural theorem which states that, for any state in a Hilbert space, if certain EPR-type equations are satisfied, the state must be essentially the orthogonal sum of EPR pairs.
Dominic Mayers, Andrew Chi-Chih Yao
FOCS1
1996 Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
Dominic Mayers
CRYPTO1
1995 On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols
Dominic Mayers
CRYPTO1