000			05193nam a22006735i 4500
001			978-3-540-24660-2
003			DE-He213
005			20240423125653.0
007			cr nn 008mamaa
008			121227s2004 gw | s |||| 0|eng d
020			_a9783540246602 _9978-3-540-24660-2
024	7		_a10.1007/b95630 _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 2004 _h[electronic resource] : _bThe Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, February 23-27, 2004, Proceedings / _cedited by Tatsuaki Okamoto.
250			_a1st ed. 2004.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004.
300			_aXII, 392 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 ; _v2964
505	0		_aSymmetric Encryption -- Online Encryption Schemes: New Security Notions and Constructions -- Related-Key Attacks on Triple-DES and DESX Variants -- Design of AES Based on Dual Cipher and Composite Field -- Periodic Properties of Counter Assisted Stream Ciphers -- A Fast Correlation Attack via Unequal Error Correcting LDPC Codes -- Aymmetric Encryption -- k-Resilient Identity-Based Encryption in the Standard Model -- A Generic Construction for Intrusion-Resilient Public-Key Encryption -- Digital Signatures -- A Certificate-Based Signature Scheme -- Identity Based Undeniable Signatures -- Compressing Rabin Signatures -- Protocols -- A Key Recovery System as Secure as Factoring -- Server Assisted Signatures Revisited -- Cryptanalysis of a Zero-Knowledge Identification Protocol of Eurocrypt ‘95 -- Universal Re-encryption for Mixnets -- Bit String Commitment Reductions with a Non-zero Rate -- Improving Robustness of PGP Keyrings by Conflict Detection -- Side-Channel Attacks -- Issues of Security with the Oswald-Aigner Exponentiation Algorithm -- Hardware Countermeasures against DPA – A Statistical Analysis of Their Effectiveness -- Self-Randomized Exponentiation Algorithms -- Hardwares -- Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems -- High-Speed Modular Multiplication -- Yet Another Sieving Device -- Mode of Operations -- A Parallelizable Enciphering Mode -- Padding Oracle Attacks on the ISO CBC Mode Encryption Standard -- Hash and Hash Chains -- A 1 Gbit/s Partially Unrolled Architecture of Hash Functions SHA-1 and SHA-512 -- Fast Verification of Hash Chains -- Visual Cryptography -- Almost Ideal Contrast Visual Cryptography with Reversing -- Ellictic Curve Cryptosystems -- Weak Fields for ECC.
520			_aThe Cryptographers’ Track (CT-RSA) is a research conference within the RSA conference, the largest, regularly staged computer security event. CT-RSA 2004 was the fourth year of the Cryptographers’ Track, and it is now an established venue for presenting practical research results related to cryptography and data security. The conference received 77 submissions, and the program committee sel- ted 28 of these for presentation. The program committee worked very hard to evaluate the papers with respect to quality, originality, and relevance to cryp- graphy. Each paper was reviewed by at least three program committee members. Extended abstracts of the revised versions of these papers are in these proc- dings. The program also included two invited lectures by Dan Boneh and Silvio Micali. I am extremely grateful to the program committee members for their en- mous investment of time and e?ort in the di?cult and delicate process of review and selection. Many of them attended the program committee meeting during the Crypto 2003 conference at the University of California, Santa Barbara.
650		0	_aCryptography.
650		0	_aData encryption (Computer science).
650		0	_aComputer networks .
650		0	_aOperating systems (Computers).
650		0	_aAlgorithms.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650		0	_aElectronic data processing _xManagement.
650	1	4	_aCryptology.
650	2	4	_aComputer Communication Networks.
650	2	4	_aOperating Systems.
650	2	4	_aAlgorithms.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aIT Operations.
700	1		_aOkamoto, Tatsuaki. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540209966
776	0	8	_iPrinted edition: _z9783662183366
830		0	_aLecture Notes in Computer Science, _x1611-3349 ; _v2964
856	4	0	_uhttps://doi.org/10.1007/b95630
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
912			_aZDB-2-BAE
942			_cSPRINGER
999			_c180476 _d180476