Advances in Cryptology - EUROCRYPT '98 International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceedings /

This book constitutes the refereed proceedings of the 1998 International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '98, held in Espoo, Finland, in May/June 1998. The book presents 44 revised full papers selected from a total of 161 submissions. The papers a...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Nyberg, Kaisa (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Έκδοση:1st ed. 1998.
Σειρά:Lecture Notes in Computer Science, 1403
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Securing threshold cryptosystems against chosen ciphertext attack
  • Auto-recoverable auto-certifiable cryptosystems
  • A practical and provably secure scheme for publicly verifiable secret sharing and its applications
  • Equivalence of counting the number of points on elliptic curve over the ring Zn and factoring n
  • Breaking RSA may not be equivalent to factoring
  • Lower bounds on generic algorithms in groups
  • Improved cryptanalysis of RC5
  • Cryptanalysis of the ANSI X9.52 CBCM mode
  • Differential-linear weak key classes of IDEA
  • Divertible protocols and atomic proxy cryptography
  • Optimum traitor tracing and asymmetric schemes
  • On finding small solutions of modular multivariate polynomial equations
  • Computing discrete logarithms with quadratic number rings
  • Improved algorithms for isomorphisms of polynomials
  • Visual cryptanalysis
  • How to improve an exponentiation black-box
  • Speeding up discrete log and factoring based schemes via precomputations
  • Fast batch verification for modular exponentiation and digital signatures
  • A formal treatment of remotely keyed encryption
  • Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
  • The chain & sum primitive and its applications to MACs and stream ciphers
  • A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
  • A new public-key cryptosystem as secure as factoring
  • Towards a better understanding of one-wayness: Facing linear permutations
  • Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
  • Secure communication in minimal connectivity models
  • On the foundations of oblivious transfer
  • Quorum-based secure multi-party computation
  • Strengthened security for blind signatures
  • Generic constructions for secure and efficient confirmer signature schemes
  • Security analysis of a practical "on the fly" authentication and signature generation
  • Universally verifiable mix-net with verification work independent of the number of mix-servers
  • A practical mix
  • On the propagation criterion of degree l and order k
  • Highly nonlinear balanced Boolean functions with a good correlation-immunity
  • Heuristic design of cryptographically strong balanced Boolean functions
  • Secret sharing schemes with bipartite access structure
  • Combinatorial bounds for broadcast encryption
  • New results on multi-receiver authentication codes
  • Specialized integer factorization
  • Security of an identity-based cryptosystem and the related reductions
  • Easy come - Easy go divisible cash
  • Secure and efficient metering
  • Optimistic fair exchange of digital signatures.