Références

BBC93

C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters. Teleporting an unkown quantum state by dual classical and EPR channels. Physical Review Letter, 70:1895--1898, 1993.

BBCM93

C.H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Privacy amplification against Probabilistic Information. IEEE Transaction on Information Theory, 1993. submitted for publication.

BBCS92

C.H. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska. Practical quantum oblivious transfer protocols. In Advances in Cryptology: Proceedings of Crypto '91, volume 576 of LNCS, pages 351--366. Springer-Verlag, 1992.

BC91

G. Brassard and C. Crépeau. Quantum bit commitment and coin tossing protocols. In Advances in Cryptology: Proceedings of Crypto '90, volume 537 of LNCS, pages 49--61. Springer-Verlag, 1991.

BCJL93

G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois. A quantum bit commitment scheme provably unbreakable by both parties. In Symposium on Foundations of Computer Science, pages 42--52. IEEE, 1993.

BCLL91

G. Brassard, C. Crépeau, S. Laplante, and C. Léger. Computationally convincing proofs of knowledge. In Proceedings of STACS '91, volume 480 of LNCS, pages 251--262. Springer-Verlag, 1991.

BCY91

G. Brassard, C. Crépeau, and M. Yung. Constant-round perfect zero-knowledge computationally convincing protocols. Theoretical Computer Science, 84:23--52, 1991.

CJL93

M. J. Coster, A. Joux, B. A. LaMacchia, A. Odlyzko, C.-P. Schnorr, and J. Stern. Improved low-density subset sum algorithms. Computational Complexity, pages --, 1993.

CJS91

Y. M. Chee, A. Joux, and J. Stern. The cryptanalysis of a new public-key cryptosystem based on modular knapsacks. In J. Feigenbaum, editor, Advances in Cryptology: Proceedings of Crypto'91, volume 576 of LNCS, pages 204--212. Springer-Verlag, 1991.

CK93

C. Crépeau and J. Kilian. Discreet solitary games. In Advances in Cryptology: Proceedings of Crypto '93, LNCS. Springer-Verlag, 1993. To appear.

Cou93

J.-M. Couveignes. Calcul et rationalité de fonctions de belyi en genre 0. soumis aux annales de l'Institut Fourrier, 1993.

Cré93

C. Crépeau. Cryptographic primitives and quantum theory. In Proceedings of the second Physics of Computation Workshop, PhysComp '92, pages 200--204, 1993.

CS91a

C. Crépeau and M. Sántha. Efficient reductions among oblivious transfer protocols based on new self-intersecting codes. In Sequences II, Methods in Communications, Security, and Computer Scien ce, pages 360--368. Springer-Verlag, 1991.

CS91b

C. Crépeau and M. Sántha. On the reversibility of oblivious transfer. In Advances in Cryptology: Proceedings of Eurocrypt '91, volume 547 of LNCS, pages 106--113. Springer-Verlag, 1991.

Jou93a

A. Joux. A fast parallel lattice reduction algorithm. Soumis au Gauss Symposium, 1993.

Jou93b

Antoine Joux. La Réduction des Réseaux en Cryptographie. Thèse de doctorat, Ecole Polytechnique, 1993. Prépublication, rapport LIENS--93--7.

JS91a

A. Joux and J. Stern. Cryptanalysis of another knapsack cryptosystem. In Advances in Cryptology: Proceedings of AsiaCrypt'91, LNCS. Springer-Verlag, 1991.

JS91b

A. Joux and J. Stern. Improving the critical density of the lagarias-odlyzko attack against subset sum problems. In L. Budach, editor, Proceedings of Fundamentals of Computation Theory 91, volume 529 of LNCS, pages 258--264. Springer-Verlag, 1991.

LS91

G. Lachaud and J. Stern. Polynomial-time construction of linear codes with almost equal weights. In A. De Santis, editor, Sequences II, Methods in Communications, Security, and Computer Science, pages ---, New York, 1991. Springer-Verlag.

LS92a

G. Lachaud and J. Stern. Polynomial-time construction of codes i: linear codes with almost equal weights. Applicable Algebra in Engineering, Communication and Computing, pages 151--161, 1992.

LS92b

G. Lachaud and J. Stern. Polynomial-time construction of spherical codes. In Proceedings of the AAECC-9 Conference, volume 539 of LNCS, pages 218--223. Springer-Verlag, 1992.

LS93

G. Lachaud and J. Stern. Polynomial-time construction of codes ii: Spherical codes and the kissing number of spheres. IEEE Transactions on Information Theory, 1993.

SAS93

J. Stern S. Arora and Z. Sweedyk. The hardness of approximating problems defined by linear constraints. 1993. submitted to FOCS '93.

Ste93a

J. Stern. Approximating the number of error locations is np-complete. In T. Mora, editor, Proceedings of the AAECC-10 Conference, LNCS. Springer-Verlag, 1993.

Ste93b

J. Stern. A new identification scheme based on syndrome decoding. 1993. submitted to Crypto '93.

Ste93c

J. Stern. Weaknesses of a public key cryptosystem based on factorization of finite groups. In T. Helleseth, editor, Avances in Cryptology: Proceedings of Eurocrypt '93, LNCS. Springer-Verlag, 1993.