Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

Advances in Cryptology - CRYPTO 2000
Ajouter à une liste

Librairie Eyrolles - Paris 5e

Advances in Cryptology - CRYPTO 2000

Advances in Cryptology - CRYPTO 2000

20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000. Proceedings


543 pages, parution le 01/09/2000


This book constitutes the refereed proceedings of the 20th Annual International Cryptology Conference, CRYPTO 2000, held in Santa Barbara, CA, USA in August 2000. The 32 revised full papers presented together with one invited contribution were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on XTR and NTRU, privacy for databases, secure distributed computation, algebraic cryptosystems, message authentication, digital signatures, cryptanalysis, traitor tracing and broadcast encryption, symmetric encryption, to commit or not to commit, protocols, and stream ciphers and Boolean functions.


  • XTR and NTRU
  • The XTR Public Key System
  • Arjen K.Lenstra,Eric R.Verheul
  • A Chosen-Ciphertext Attack against NTRU
  • Eliane Jaulmes,Antoine Joux
  • Privacy for Databases
  • Privacy Preserving Data Mining
  • Yehuda Lindell,Benny Pinkas
  • Reducing the Servers Computation in Private Information Retrieval:
  • PIR with Preprocessing
  • Amos Beimel,Yuval Ishai,Tal Malkin
  • Secure Distributed Computation and Applications
  • Parallel Reducibilit for Information-Theoretically Secure Computation
  • Yevgeniy Dodis,Silvio Micali
  • Optimistic Fair Secure Computation
  • Christian Cachin,Jan Camenisch
  • A Cryptographic Solution to a Game Theoretic Problem
  • Yevgeniy Dodis,Shai Halevi,Tal Rabin
  • Algebraic Cryptosystems
  • Differential Fault Attacks on Elliptic Curve Cryptosystems
  • Ingrid Biehl,Bernd Meyer,Volker Muller
  • Quantum Public-Key Cryptosystems
  • Tatsuaki Okamoto,Keisuke Tanaka,Shigenori Uchiyama
  • New Public-Key Cryptosystem Using Braid Groups
  • Ki Hyoung Ko,Sang Jin Lee,Jung Hee Cheon,Jae Woo Han,
  • Ju-sung Kang,Choonsik Park
  • Message Authentication
  • Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
  • Don Coppersmith,Lars R.Knudsen,Chris J.Mitchell
  • CBC MACs for Arbitrary-Length Messages:The Three-Key Constructions
  • John Black,Phillip Rogaway
  • L-collision Attacks against Randomized MACs
  • Michael Semanko
  • Digital Signatures
  • On the Exact Securit of Full Domain Hash
  • Jean-Sebastien Coron
  • Timed Commitments
  • Dan Boneh,Moni Naor
  • A Practical and Provably
  • Secure Coalition-Resistant Group Signature Scheme
  • Giuseppe Ateniese,Jan Camenisch,Marc Joye,Gene Tsudik
  • Provably Secure Partially Blind Signatures
  • Masayuki Abe,Tatsuaki Okamoto
  • Cryptanalysis
  • Weaknesses in the SL 2 (IF 2 n )Hashing Scheme
  • Rainer Steinwandt,Markus Grassl,Willi Geiselmann,Thomas Beth
  • Fast Correlation Attacks through Reconstruction of Linear Polynomials
  • Thomas Johansson,Fredrik Johansson
  • Traitor Tracing and Broadcast Encryption
  • Sequential Traitor Tracing
  • Reihaneh Safavi-Naini,Yejing Wang
  • Long-Lived Broadcast Encryption
  • Juan A.Garay,Jessica Staddon,Avishai Wool
  • Invited Talk
  • Taming the Adversary
  • Martin Abadi
  • Symmetric Encryption
  • The Securit of All-or-Nothing Encryption:
  • Protecting against Exhaustive Key Search
  • Anand Desai
  • On the Round Securit of Symmetric-Key Cryptographic Primitives
  • Zufikar Ramzan,Leonid Reyzin
  • New Paradigms for Constructing Symmetric Encryption Schemes Secure
  • against Chosen-Ciphertext Attack
  • Anand Desai
  • To Commit or Not to Commit
  • Efficient Non-malleable Commitment Schemes
  • Marc Fischlin,Roger Fischlin
  • Improved Non-committing Encryption Schemes
  • Based on a General Complexit Assumption
  • Ivan Damgard,Jesper Buus Nielsen
  • Protocols
  • A Note on the Round-Complexit of Concurrent Zero-Knowledge
  • Alon Rosen
  • An Improved Pseudo-random Generator Based on Discrete Log
  • Rosario Gennaro
  • Linking Classical and Quantum Key Agreement:
  • Is There "Bound Information "?
  • Nicolas Gisin,Stefan Wolf
  • Stream Ciphers and Boolean Functions
  • Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
  • Muxiang Zhang,Agnes Chan
  • Nonlinearit Bounds and Constructions of Resilient Boolean Functions
  • Palash Sarkar,Subhamoy Maitra
  • Almost Independent and Weakly Biased Arrays:
  • Efficient Constructions and Cryptologic Applications
  • Jurgen Bierbrauer,Holger Schellwat
  • Author Index

Caractéristiques techniques

Éditeur(s) Springer
Auteur(s) Bellare
Parution 01/09/2000
Nb. de pages 543
Format 15,5 x 23,5
Couverture Broché
Poids 826g
Intérieur Noir et Blanc
EAN13 9783540679073


Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.