000 | 05708nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-540-69795-4 | ||
003 | DE-He213 | ||
005 | 20240423132457.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540697954 _9978-3-540-69795-4 |
||
024 | 7 |
_a10.1007/BFb0054112 _2doi |
|
050 | 4 | _aQA268 | |
072 | 7 |
_aGPJ _2bicssc |
|
072 | 7 |
_aURY _2bicssc |
|
072 | 7 |
_aCOM083000 _2bisacsh |
|
072 | 7 |
_aGPJ _2thema |
|
072 | 7 |
_aURY _2thema |
|
082 | 0 | 4 |
_a005.824 _223 |
245 | 1 | 0 |
_aAdvances in Cryptology – EUROCRYPT '98 _h[electronic resource] : _bInternational Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceedings / _cedited by Kaisa Nyberg. |
250 | _a1st ed. 1998. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
300 |
_aXI, 613 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1403 |
|
505 | 0 | _aSecuring 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. | |
520 | _aThis 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. | ||
650 | 0 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aData protection. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer networks . | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aComputers and civilization. | |
650 | 1 | 4 | _aCryptology. |
650 | 2 | 4 | _aData and Information Security. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputers and Society. |
700 | 1 |
_aNyberg, Kaisa. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540645184 |
776 | 0 | 8 |
_iPrinted edition: _z9783662199077 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1403 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0054112 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188187 _d188187 |