Advances in Cryptology: EUROCRYPT 2001 : International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001 : Proceedings
Springer, Jan 1, 2001 - Computers - 544 pages
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R & D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes: proceedings (published in time for the respective conference); post-proceedings (consisting of thoroughly revised final full papers); research monographs (which may be based on outstanding PhD); work, research projects, technical reports, etc.)
What people are saying - Write a review
We haven't found any reviews in the usual places.
Finding Secure Curves with the SatohFGH Algorithm
How Secure Are Elliptic Curves over Composite Extension Fields?
29 other sections not shown
Other editions - View all
adaptive security Advances in Cryptology adversary adversary's algorithm AONT's assume assumption attack authentication blind signatures block cipher characteristic choose chosen ciphertext coefficients commitment scheme Computer Science construction corrupted credential CRHFs CRYPTO cryptographic Cryptology cryptosystem decommitment decryption defined definition denote Diffie-Hellman problem discrete logarithm distribution elliptic curve encryption scheme EUROCRYPT existential forgery exists given hash function homomorphic homomorphic encryption input interaction j-invariant lattice Lemma linear LNCS Micali MISTY2 MMAC mod q modulo multiset notion NTRU oblivious transfer one-way function output pair parties permutation plaintexts polynomial prime private key probabilistic protocol prove pseudorandom public key quantum query random oracle redundancy code reset round S-boxes secret key Section security parameter semantically secure server session key signature scheme simulator Springer-Verlag string subkey success probability Theorem trapdoor UOWHFs upper bound valid vector verifier zero-knowledge proofs