|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Kaisa NybergPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 1998 ed. Volume: 1403 Dimensions: Width: 15.50cm , Height: 3.10cm , Length: 23.50cm Weight: 1.900kg ISBN: 9783540645184ISBN 10: 3540645187 Pages: 613 Publication Date: 13 May 1998 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsSecuring 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |