Muutke küpsiste eelistusi

Advances in Cryptology EUROCRYPT 2001: International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 610, 2001, Proceedings 2001 ed. [Pehme köide]

  • Formaat: Paperback / softback, 544 pages, kõrgus x laius: 235x155 mm, kaal: 848 g, 23 Illustrations, black and white; XIII, 544 p. 23 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 2045
  • Ilmumisaeg: 25-Apr-2001
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540420703
  • ISBN-13: 9783540420705
Teised raamatud teemal:
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 544 pages, kõrgus x laius: 235x155 mm, kaal: 848 g, 23 Illustrations, black and white; XIII, 544 p. 23 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 2045
  • Ilmumisaeg: 25-Apr-2001
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540420703
  • ISBN-13: 9783540420705
Teised raamatud teemal:
EUROCRYPT 2001, the 20th annual Eurocrypt conference, was sponsored by the IACR, the International Association for Cryptologic Research, see http://www. iacr. org/, this year in cooperation with the Austrian Computer - ciety (OCG). The General Chair, Reinhard Posch, was responsible for local or- nization, and registration was handled by the IACR Secretariat at the University of California, Santa Barbara. In addition to the papers contained in these proceedings, we were pleased that the conference program also included a presentation by the 2001 IACR d- tinguished lecturer, Andrew Odlyzko, on “Economics and Cryptography” and an invited talk by Silvio Micali, “Zero Knowledge Has Come of Age. ” Furthermore, there was the rump session for presentations of recent results and other (p- sibly satirical) topics of interest to the crypto community, which Jean-Jacques Quisquater kindly agreed to run. The Program Committee received 155 submissions and selected 33 papers for presentation; one of them was withdrawn by the authors. The review process was therefore a delicate and challenging task for the committee members, and I wish to thank them for all the e ort they spent on it. Each committee member was responsible for the review of at least 20 submissions, so each paper was carefully evaluated by at least three reviewers, and submissions with a program committee member as a (co-)author by at least six.

Muu info

Springer Book Archives
Elliptic Curves A Memory Efficient Version of Satohs Algorithm 1(13) Frederik Vercauteren Bart Preneel Joos Vandewalle Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy 14(16) Mireille Fouquet Pierrick Gaudry Robert Harley How Secure Are Elliptic Curves over Composite Extension Fields? 30(10) Nigel P. Smart Commitments Efficient and Non-interactive Non-malleable Commitment 40(20) Giovanni Di Crescenzo Johnathan Katz Rafail Ostrovsky Adam Smith How to Convert the Flavor of a Quantum Bit Commitment 60(18) Claude Crepeau Frederic Legare Louis Salvail Anonymity Cryptographic Counters and Applications to Electronic Voting 78(15) Jonathan Katz Steven Myers Rafail Ostrovsky An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation 93(26) Jan Camenisch Anna Lysyanskaya Priced Oblivious Transfer: How to Sell Digital Goods 119(17) Bill Aiello Yuval Ishai Omer Reingold Signatures and Hash Functions A Secure Three-Move Blind Signature Scheme for Polynomically Many Signatures 136(16) Masayuki Abe Practical Threshold RSA Signatures without a Trusted Dealer 152(14) Ivan Damgard Maciej Koprowski Hash Functions: From Merkle-Damagard to Shoup 166(16) Ilya Mirronov XTR and NTRU Key Recovery and Message Attacks on NTRU-Composite 182(13) Craig Gentry Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems 195(16) Eric R. Verheul NSS: An NTRU Lattice-Based Signature Scheme 211(18) Jeffrey Hoffstein Jill Pipher Assumptions The Bit Security of Pailliers Encryption Scheme and Its Applications 229(15) Dario Catalano Rosario Gennaro Nick Howgrave-Graham Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference 244(18) Ahmad-Reza Sadeghi Michael Steiner Multiparty Protocols On Adaptive vs. Non-adaptive Security of Multiparty Protocols 262(18) Ran Canetti Ivan Damgard Stefan Dziembowski Yuval Ishai Tal Malkin Multiparty Computation from Threshold Homomorphic Encryption 280(21) Ronald Cramer Ivan Damgard Jesper B. Nielsen On Perfact and Adaptive Security in Exposure-Resilient Cryptography 301(24) Yevgeniy Dodis Amit Sahai Adam Smith Block Ciphers Cryptanalysis of Reduced-Round MISTY 325(15) Ulrich Kuhn The Rectangle Attack -- Rectangling the Serpent 340(18) Eli Biham Orr Dunkelman Nathan Keller Primitives Efficient Amuplification of the Security of Weak Pseudo-Random Function Generators 358(15) Steven Myers Min-round Resettable Zero-Knowledge in the Public-Key Model 373(21) Silvio Micali Leonid Reyzin Symmetric Ciphers Structural Cryptanalysis of SASAS 394(12) Alex Biryukov Adi Shamir Hyper-bent Functions 406(14) Amr M. Youssef Guang Gong New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs 420(17) Liam Keliher Henk Meijer Stafford Tavares Key Exchange and Multicast Lower Bounds for Multicast Message Authentication 437(16) Dan Boneh Glenn Durfee Matt Franklin Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels 453(22) Ran Canetti Hugo Krawczyk Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords 475(20) Jonathan Katz Rafail Ostrovsky Moti Yung Authentication and Identification Identification Protocols Secure against Reset Attacks 495(17) Mihir Bellare Marc Fischlin Shafi Goldwasser Silvio Micali Does Encryption with Redundancy Provide Authenticity? 512(17) Jee Hea An Mihir Bellare Encryption Modes with Almost Free Message Integrity 529(16) Charanjit S. Jutla Author Index 545