000 04469nam a22006615i 4500
001 978-3-540-36563-1
003 DE-He213
005 20240423132507.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540365631
_9978-3-540-36563-1
024 7 _a10.1007/3-540-36563-X
_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 _aTopics in Cryptology -- CT-RSA 2003
_h[electronic resource] :
_bThe Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA April 13-17, 2003, Proceedings /
_cedited by Marc Joye.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aXII, 424 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 ;
_v2612
505 0 _aKey Self-protection -- Forward-Security in Private-Key Cryptography -- Intrusion-Resilient Public-Key Encryption -- Message Authentication -- TMAC: Two-Key CBC MAC -- Montgomery Prime Hashing for Message Authentication -- Digital Signatures -- An Analysis of Proxy Signatures: Is a Secure Channel Necessary? -- Invisibility and Anonymity of Undeniable and Confirmer Signatures -- Pairing Based Cryptography -- A Secure Signature Scheme from Bilinear Maps -- Access Control Using Pairing Based Cryptography -- Multivariate and Lattice Problems -- NTRUSign: Digital Signatures Using the NTRU Lattice -- About the XL Algorithm over GF(2) -- Cryptographic Architectures -- Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications -- Hardware Performance Characterization of Block Cipher Structures -- New RSA-based Cryptosystems -- Simple Identity-Based Cryptography with Mediated RSA -- Two Birds One Stone: Signcryption Using RSA -- Invited Talk I -- Cryptography after the Bubble: How to Make an Impact on the World -- Chosen-Ciphertext Security -- Rethinking Chosen-Ciphertext Security under Kerckhoffs’ Assumption -- Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes -- Broadcast Encryption and PRF Sharing -- Fault Tolerant and Distributed Broadcast Encryption -- Shared Generation of Pseudo-Random Functions with Cumulative Maps -- Authentication Structures -- Authenticated Data Structures for Graph and Geometric Searching -- Fractal Merkle Tree Representation and Traversal -- Invited Talk II -- RSA Shortcuts -- Elliptic Curves and Pairings -- The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks -- Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation -- Threshold Cryptography -- Two Efficient andProvably Secure Schemes for Server-Assisted Threshold Signatures -- Secure Applications of Pedersen’s Distributed Key Generation Protocol -- Implementation Issues -- Seeing through Mist Given a Small Fraction of an RSA Private Key -- Simple Backdoors for RSA Key Generation.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aComputer networks .
650 0 _aOperating systems (Computers).
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputers and civilization.
650 0 _aElectronic data processing
_xManagement.
650 1 4 _aCryptology.
650 2 4 _aComputer Communication Networks.
650 2 4 _aOperating Systems.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputers and Society.
650 2 4 _aIT Operations.
700 1 _aJoye, Marc.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540008477
776 0 8 _iPrinted edition:
_z9783662189382
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2612
856 4 0 _uhttps://doi.org/10.1007/3-540-36563-X
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188365
_d188365