Coverart for item
The Resource Advances in Cryptology — EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings, edited by Birgit Pfitzmann, (electronic resource)

Advances in Cryptology — EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings, edited by Birgit Pfitzmann, (electronic resource)

Label
Advances in Cryptology — EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings
Title
Advances in Cryptology — EUROCRYPT 2001
Title remainder
International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings
Statement of responsibility
edited by Birgit Pfitzmann
Creator
Contributor
Editor
Provider
Subject
Language
eng
Summary
This book constitutes the refereed proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001, held in Innsbruck, Austria in May 2001. The 32 revised full papers presented were carefully reviewed and selected from a total of 155 submissions. The papers are organized in topical sections on elliptic curves, commitments, anonymity, signatures and hash functions, XTR and NTRU, assumptions, multiparty protocols, block ciphers, primitives, symmetric ciphers, key exchange and multicast, and authentication and identification
Member of
http://library.link/vocab/creatorName
Pfitzmann, Birgit
Image bit depth
0
LC call number
QA76.9.A25
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
2045
http://library.link/vocab/subjectName
  • Computer science
  • Computer Communication Networks
  • Data encryption (Computer science)
  • Computer software
  • Information Systems
  • Computer science
  • Computer Science
  • Data Encryption
  • Mathematics of Computing
  • Management of Computing and Information Systems
  • Computer Communication Networks
  • Algorithm Analysis and Problem Complexity
  • Computational Mathematics and Numerical Analysis
Label
Advances in Cryptology — EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings, edited by Birgit Pfitzmann, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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 Probability for 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
Dimensions
unknown
Extent
XIII, 544 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540449874
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-44987-6
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-44987-4
Label
Advances in Cryptology — EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6–10, 2001 Proceedings, edited by Birgit Pfitzmann, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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 Probability for 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
Dimensions
unknown
Extent
XIII, 544 p.
File format
multiple file formats
Form of item
electronic
Isbn
9783540449874
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-44987-6
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-44987-4

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...