Amazon cover image
Image from Amazon.com

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

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 1403Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998Edition: 1st ed. 1998Description: XI, 613 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540697954
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.824 23
LOC classification:
  • QA268
Online resources:
Contents:
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 secureand 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.
In: Springer Nature eBookSummary: 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 are organized in sections on distributed cryptography, complexity, cryptanalysis of block ciphers, computational algorithms, paradigms for symmetric systems, public key cryptosystems, multi-party computation, digital signatures, Boolean functions, combinatorial design and analysis, elliptic curve systems, and electronic commerce and payment.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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 secureand 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.

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 are organized in sections on distributed cryptography, complexity, cryptanalysis of block ciphers, computational algorithms, paradigms for symmetric systems, public key cryptosystems, multi-party computation, digital signatures, Boolean functions, combinatorial design and analysis, elliptic curve systems, and electronic commerce and payment.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in