(Enter summary)
Abstract: icipants and the
view of the adversary who performs the attack. If an interface exists such that the
profile of protocol 1 is indistinguishable from the profile of protocol 2 with the help
of this interface, then protocol 1 is at least as secure as protocol 2. An absolute
notion of security is obtained by comparing the protocol implementation with its
`ideal' equivalent.
In this approach, and in classical cryptography in general, indistinguishability of
probability distributions is a crucial... (Update)
Context of citations to this paper: More
...Norm of A, denoted by T r A , is the sum of the absolute values of the eigenvalues of A. The following upper bound is very important. Theorem 2. [17] For any two density matrices # # 0 and # # 1 , defined on some space H, SD(# # 0 , # # 1 ) # 1 2 T r # # 0 # # 1 ....
...are translated to the quantum setting in the most straightforward ways. For a further discussion of these problems, see van de Graaf [15]. The goal of this paper is not to attempt to resolve these difficulties, or to propose a definition for quantum zeroknowledge that is...
Cited by: More
Limits on the Power of Quantum Statistical Zero-Knowledge - Watrous (2002)
(Correct)
Security of Quantum Key Distribution Against All.. - Biham, Boyer..
(Correct)
Active bibliography (related documents): More All
1.8: Cryptology Column - 25 Years of Quantum Cryptography - Brassard, Crépeau (1996)
(Correct)
1.3: The Trouble with Quantum Bit Commitment - Mayers (1996)
(Correct)
0.9: A Quick Glance at Quantum Cryptography - Lomonaco, Jr. (1998)
(Correct)
Similar documents based on text: More All
1.1: Demand-Driven Type Analysis for Dynamically-Typed Functional.. - Dubé
(Correct)
0.6: Universal And Cognitive Notions Of 'part' - Jos Hemfindez-Orallo Universitat
(Correct)
0.6: Text Prediction for Translators - Foster (2002)
(Correct)
Related documents from co-citation: More All
2: Quantum cryptography: Public key distribution and coin tossing (context) - Charles, Gilles - 1984
2: Simple proof of security of the BB84 quantum key distribution protocol (context) - Shor, Preskill - 2000
BibTeX entry: (Update)
J. van de Graaf, Towards a formal definition of security for quantum protocols, PhD thesis, DIRO, Universite de Montreal, 1997. http://citeseer.ist.psu.edu/vandegraaf97towards.html More
@misc{ graaf97towards,
author = "J. Graaf",
title = "Towards a formal definition of security for quantum protocols",
text = "J. van de Graaf, Towards a formal definition of security for quantum protocols,
PhD thesis, DIRO, Universite de Montreal, 1997.",
year = "1997",
url = "citeseer.ist.psu.edu/vandegraaf97towards.html" }
Citations (may not include all citations):
1447
A mathematical theory of communication (context) - SHANNON - 1948 ACM
660
An introduction to Kolmogorov Complexity and its Application..
- LI, ANYI - 1993 ACM
531
The knowledge complexity of interactive proof-systems (context) - GOLDWASSER, MICALI et al. - 1989
531
The knowledge complexity of interactive proof-systems (context) - GOLDWASSER, MICALI et al. - 1985
339
Theory and application of trapdoor functions (context) - YAO - 1982
287
Multi-party unconditionally secure protocols (context) - CHAUM, CREPEAU et al. - 1988
241
Communication theory of secrecy systems (context) - SHANNON - 1949
202
Wiley Series in Telecommunications (context) - COVER, THOMAS - 1991
196
Minimum disclosure proofs of knowledge (context) - BRASSARD, CHAUM et al. - 1988 ACM DBLP
174
How to exchange secrets by oblivious transfer (context) - RABIN - 1981
173
Quantum complexity theory
- BERNSTEIN, VAZIRANI - 1997 ACM DBLP
167
Protocols for secure computations (context) - YAO - 1982
147
Efficient signature generation by smart cards (context) - SCHNORR - 1991 DBLP
127
Verifiable secret sharing and multiparty protocols with hone.. (context) - RABIN, BEN-OR - 1989 ACM
120
Secure Computation (context) - MICALI, ROGAWAY
116
Simulating physics with computers
- FEYNMAN - 1982 ACM
100
Founding cryptography on oblivious transfer (context) - KILIAN - 1988 DBLP
90
Quantum cryptography: Public key distribution and coin tossi.. (context) - BENNETT, BRASSARD - 1984
90
Secure multiparty protocols and zero-knowledge proof systems.. (context) - BEAVER - 1991 DBLP
89
Untraceable electronic mail, return addresses, and digital p.. (context) - CHAUM - 1981 ACM DBLP
78
Foundations of secure interactive computing (context) - BEAVER - 1991 ACM DBLP
69
Adaptively secure multi-party computation
- CANETTI, FEIGE et al. - 1996 ACM DBLP
67
Experimental quantum cryptography
- BENNETT, BESSETTE et al. - 1992
67
Definitions and properties of zero-knowledge proof systems
- GOLDREICH, OREN - 1994
63
Witness indistinguishable and witness hiding protocols (context) - FEIGE, SHAMIR - 1990 ACM DBLP
59
Can the quantummechanical description of physical reality be.. (context) - EINSTEIN, PODOLSKI et al. - 1935
51
Massachusetts Institute of Technology (context) - ROGAWAY - 1991
48
Quantum theory, the Church-Turing principle and the universa..
- DEUTSCH - 1985
45
Fault-tolerant quantum computation
- SHOR - 1996 ACM DBLP
44
a measure of the information provided by an experiment (context) - LINDLEY - 1956
42
Quantum Theory and Measurement (context) - WHEELER, ZUREK - 1983
41
Unconditionally secure quantum bit commitment is impossible (context) - MAYERS - 1997
40
A single quantum cannot be cloned (context) - WOOTTERS, ZUREK - 1982
37
The divergence and Bhattacharyya distance measures in signal.. (context) - KAILATH - 1967
36
A quantum bit commitment scheme provably unbreakable by both..
- BRASSARD, EPEAU et al. - 1993 ACM DBLP
33
Quantum cryptography (context) - BENNETT, BRASSARD et al. - 1992
32
Coin flipping by telephone (context) - BLUM - 1982 DBLP
32
the cunning power of cheating verifiers: Some observations a.. (context) - OREN - 1987
30
Multiparty computation with faulty majority (context) - BEAVER, GOLDWASSER - 1989
27
Uses of Randomness in Algorithms and Protocols (context) - KILIAN - 1990 ACM
26
Perfect zero-knowledge arguments for np can be based on gene..
- NAOR, OSTROVSKY et al. - 1992
25
Why quantum bit commitment and ideal quantum coin tossing ar.. (context) - LO - 1997
22
Mental poker (context) - SHAMIR, RIVEST et al. - 1981
21
Multiparty protocols tolerating half faulty processors (context) - BEAVER - 1989 ACM DBLP
20
Fidelity for mixed quantum states (context) - JOZSA - 1994
19
Kluwer Academic Publishers (context) - PERES - 1993
18
Committed oblivious transfer and private multi-party computa.. (context) - EPEAU, GRAAF et al. - 1995 ACM DBLP
17
Security of quantum protocols against coherent measurements
- YAO - 1995 ACM DBLP
15
Quantum oblivious transfer (context) - EPEAU - 1994
15
Oblivious transfers and intersecting codes
- BRASSARD, EPEAU et al. - 1996
14
Quantum cryptography without Bell's theorem (context) - BENNETT, BRASSARD et al. - 1992
13
Correct and Private Reductions Among Oblivious Transfers (context) - EPEAU - 1990
13
Strengths and weaknesses of quantum computation (context) - BENNETT, BERNSTEIN et al. - 1997
11
Distinguishability and Accessible Information in Quantum The..
- FUCHS - 1995
11
Reliable quantum computer
- PRESKILL - 1997
11
Quantum computing (context) - STEANE - 1997
10
Statistical distance and Hilbert space (context) - WOOTTERS - 1981
10
Computer Science Department (context) - FRANKLIN - 1993
10
Completeness theorems for fault-tolerant distributed computi.. (context) - BEN-OR, GOLDWASSER et al. - 1988
9
Ensemble-dependent bounds for accessible information in quan.. (context) - FUCHS, CAVES - 1994
9
Oblivious transfers and privacy amplification
- BRASSARD, EPEAU - 1997 DBLP
9
Is quantum bit commitment really possible
- LO - 1997
8
Efficient cryptographic protocols based on noisy channels (context) - EPEAU - 1997
8
Sorting out zero-knowledge
- BRASSARD, EPEAU - 1989 ACM DBLP
7
The Church-Turing thesis as a guiding principle for physics (context) - SVOZIL - 1997
6
Die gegenwartige Situation in der Quantenmechanik (context) - ODINGER - 1935
5
Lectures on Quantum Theory (context) - ISHAM - 1995
5
Mathematical techniques for quantum communication theory (context) - FUCHS, CAVES - 1995
5
Weakening security assumptions and oblivious transfer (context) - EPEAU, KILIAN - 1988 ACM
5
personal communication (context) - MAYERS, SALVAIL - 1997
4
and Communication Complexity in Distributed Systems (context) - BEAVER - 1990
4
The Ithaca Interpretation of Quantum Mechanics (context) - MERMIN - 1996
4
Insecurity of quantum secure computations
- LO - 1997
4
transition probability' in the state space of a -algebra (context) - UHLMANN - 1976
3
Optimal eavesdropping in quantum cryptography. I. Informatio.. (context) - FUCHS, GISIN et al. - 1997
3
The parity bit in quantum cryptography (context) - BENNETT, MOR et al. - 1996
3
Use of distance measures, information measures and error bou.. (context) - BEN-BASSAT - 1982
2
Some functional lower bounds on the expected divergence for .. (context) - TOUSSAINT - 1971
2
The Structure and Interpretation of Quantum Mechanics (context) - HUGHES - 1989
2
Mathematics in Science and Engineering (context) - HELSTROM - 1976
2
Security of quantum key distribution against all collective ..
- BIHAM, BOYER et al. - 1998 DBLP
2
Information gain vs. state disturbance in quantum theory (context) - FUCHS - 1996
1
Probability of error, equivocation, and the Chernoff bound (context) - HELLMAN, RAVIV - 1970
1
Quantum Memory in Quantum Cryptography (context) - MOR - 1997
1
Quantum attacks on classical bit commitment schemes (context) - BRASSARD, EPEAU et al. - 1997
1
Comments on `The divergence and Bhattacharyya distance measu.. (context) - TOUSSAINT - 1972
1
Coherent eavesdropping strategies for the 4 state quantum cr.. (context) - CIRAC, GISIN - 1997
1
personal communication (context) - BEAVER - 1996
1
Is quantum bit commitment really impossible (context) - BODOR - 1997
1
Unconditionally secure quantum bit commitment (context) - KENT - 1997
1
June 1995; Revised: March 1996 (context) - CANETTI - 1996
1
Methods of Modern Mathematical Physics --- Part I: Functiona.. (context) - REED, SIMON - 1972
1
The matchmaking problem
- GRAAF - 1995
1
Measures of distance between quantum states (context) - OWSKI - 1996
Documents on the same site (http://www.cenapad.ufmg.br/~jvdg/):
The Match-making Problem - Graaf (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC