Advances in Cryptology – EUROCRYPT '98: International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceedings: Lecture Notes in Computer Science, cartea 1403
Editat de Kaisa Nybergen Limba Engleză Paperback – 13 mai 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.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 407.01 lei
Nou
Puncte Express: 611
Preț estimativ în valută:
77.89€ • 80.82$ • 65.10£
77.89€ • 80.82$ • 65.10£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540645184
ISBN-10: 3540645187
Pagini: 624
Ilustrații: XI, 613 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540645187
Pagini: 624
Ilustrații: XI, 613 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras