• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

10% rabatt på allt med kod: NYSTART10 →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Samhälle och politik
    2. Samhälle och kultur
    3. Kultur och medier
    4. Referensverk och tvärvetenskap

    Advances in Cryptology – EUROCRYPT 2001

    International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001, Proceedings

    AvBirgit Pfitzmann,B. Pfitzmann

    Häftad, Engelska, 2001

    Del i serien Lecture Notes in Computer Science

    563 kr

    Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

    Beskrivning

    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.

    Produktinformation

    • Utgivningsdatum:2001-04-25
    • Mått:155 x 235 x 30 mm
    • Vikt:838 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:Lecture Notes in Computer Science
    • Antal sidor:544
    • Upplaga:2001
    • Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    • ISBN:9783540420705

    Utforska kategorier

    • Referensverk och tvärvetenskap inom Samhälle och politik
    • IT-säkerhet inom Data och IT

    Innehållsförteckning

    • Elliptic Curves.- A Memory Efficient Version of Satoh’s Algorithm.- Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy.- How Secure Are Elliptic Curves over Composite Extension Fields?.- Commitments.- Efficient and Non-interactive Non-malleable Commitment.- How to Convert the Flavor of a Quantum Bit Commitment.- Anonymity.- Cryptographic Counters and Applications to Electronic Voting.- An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.- Priced Oblivious Transfer: How to Sell Digital Goods.- Signatures and Hash Functions.- A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures.- Practical Threshold RSA Signatures without a Trusted Dealer.- Hash Functions: From Merkle-Damgård to Shoup.- XTR and NTRU.- Key Recovery and Message Attacks on NTRU-Composite.- Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems.- NSS: An NTRU Lattice-Based Signature Scheme.- Assumptions.- The Bit Security of Paillier’s Encryption Scheme and Its Applications.- Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference.- Multiparty Protocols.- On Adaptive vs. Non-adaptive Security of Multiparty Protocols.- Multiparty Computation from Threshold Homomorphic Encryption.- On Perfect and Adaptive Security in Exposure-Resilient Cryptography.- Block Ciphers.- Cryptanalysis of Reduced-Round MISTY.- The Rectangle Attack — Rectangling the Serpent.- Primitives.- Efficient Amplification of the Security of Weak Pseudo-random Function Generators.- Min-round Resettable Zero-Knowledge in the Public-Key Model.- Symmetric Ciphers.- Structural Cryptanalysis of SASAS.- Hyper-bent Functions.- New Method for Upper Bounding the Maximum Average Linear Hull Probabilityfor SPNs.- Key Exchange and Multicast.- Lower Bounds for Multicast Message Authentication.- Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels.- Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords.- Authentication and Identification.- Identification Protocols Secure against Reset Attacks.- Does Encryption with Redundancy Provide Authenticity?.- Encryption Modes with Almost Free Message Integrity.