The following pages link to Gilles Brassard (Q268455):
Displayed 50 items.
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\) (Q268457) (← links)
- Strict hierarchy among Bell theorems (Q387016) (← links)
- Classical, quantum and nonsignalling resources in bipartite games (Q387029) (← links)
- Quantum cryptography: public key distribution and coin tossing (Q477162) (← links)
- Quantum computing without entanglement (Q596121) (← links)
- Quantum communication complexity (Q720535) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- Can quantum-mechanical description of physical reality be considered correct? (Q972637) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- The generation of random permutations on the fly (Q1111400) (← links)
- A generalization of Hellman's extension of Shannon's approach to cryptography (Q1112784) (← links)
- The generation of random numbers that are probably prime (Q1118632) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- Modern cryptology. A tutorial (Q1188527) (← links)
- Teleportation as a quantum computation. (Q1586918) (← links)
- Security of quantum key distribution against all collective attacks (Q1871825) (← links)
- Oblivious transfer and privacy amplification (Q1879418) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Key establishment à la Merkle in a quantum world (Q2318085) (← links)
- Quantum pseudo-telepathy (Q2505724) (← links)
- Experimental quantum cryptography. (Q2642405) (← links)
- Multi-particle entanglement via two-party entanglement (Q2766193) (← links)
- Cryptography in a Quantum World (Q2794335) (← links)
- Exact simulation of the GHZ distribution (Q2969043) (← links)
- An Update on Quantum Cryptography (Q2974500) (← links)
- Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution (Q2977010) (← links)
- (Q3046157) (← links)
- Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial (Q3107878) (← links)
- Oblivious transfers and intersecting codes (Q3129464) (← links)
- (Q3374915) (← links)
- (Q3392685) (← links)
- Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost (Q3455198) (← links)
- (Q3495188) (← links)
- (Q3522528) (← links)
- (Q3522552) (← links)
- (Q3674539) (← links)
- (Q3686040) (← links)
- Relativized cryptography (Q3689089) (← links)
- (Q3716292) (← links)
- Zero-Knowledge Simulation of Boolean Circuits (Q3778677) (← links)
- (Q3786518) (← links)
- Privacy Amplification by Public Discussion (Q3787912) (← links)
- (Q3793691) (← links)
- (Q4023840) (← links)
- (Q4035674) (← links)
- (Q4040055) (← links)
- A note on the complexity of cryptography (Corresp.) (Q4174761) (← links)
- (Q4240337) (← links)
- (Q4279563) (← links)
- (Q4279566) (← links)