000 | 05400nam a22006615i 4500 | ||
---|---|---|---|
001 | 978-3-540-69328-4 | ||
003 | DE-He213 | ||
005 | 20240423125715.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540693284 _9978-3-540-69328-4 |
||
024 | 7 |
_a10.1007/11967668 _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 2007 _h[electronic resource] : _bThe Cryptographers' Track at the RSA Conference 2007, San Fancisco, CA, USA, February 5-9, 2007, Proceedings / _cedited by Masayuki Abe. |
250 | _a1st ed. 2006. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
300 |
_aXI, 403 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aSecurity and Cryptology, _x2946-1863 ; _v4377 |
|
505 | 0 | _aSymmetric-Key Encryption -- MV3: A New Word Based Stream Cipher Using Rapid Mixing and Revolving Buffers -- A Simple Related-Key Attack on the Full SHACAL-1 -- Signatures and Authentication -- Impossibility Proofs for RSA Signatures in the Standard Model -- Selecting Secure Passwords -- Human Identification Through Image Evaluation Using Secret Predicates -- Hash Functions -- Cryptanalysis of Reduced Variants of the FORK-256 Hash Function -- Second Preimages for SMASH -- Digital Signatures (I) -- A Practical Optimal Padding for Signature Schemes -- Directed Transitive Signature Scheme -- Identity-Based Multi-signatures from RSA -- Cryptographic Protocols (I) -- Improved Efficiency for Private Stable Matching -- Compact E-Cash from Bounded Accumulator -- Batch Processing of Interactive Proofs -- Side-Channel Attacks (I) -- Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls -- Predicting Secret Keys Via Branch Prediction -- Side-Channel Attacks (II) -- Template Attacks on Masking—Resistance Is Futile -- Differential Power Analysis of Stream Ciphers -- Cache Based Remote Timing Attack on the AES -- Cryptographic Protocols (II) -- Group Secret Handshakes Or Affiliation-Hiding Authenticated Group Key Agreement -- Efficient Password-Authenticated Key Exchange Based on RSA -- Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels -- Digital Signatures (II) -- A Practical and Tightly Secure Signature Scheme Without Hash Function -- How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature -- Efficient Implementation -- Public Key Cryptography and RFID Tags -- A Bit-Slice Implementation of the Whirlpool Hash Function. | |
520 | _aThe RSA Conference, with over 15,000 attendees and 300 exhibitors, is the largest computer security event of the year. The Cryptographers’ Track (CT- RSA) is a research conference within the RSA Conference. Starting in 2001, CT-RSA continues to its seventh year and is now regarded as one of the major regularly staged event for presenting the results of cryptographic research to a wide variety of audiences. The proceedings of CT-RSA 2007 contain 25 papers selected from 73 s- missions which cover all the topics of cryptography. All the submissions were reviewed by at least three reviewers, which was possible by the hard work of 23 Program Committee members and many external reviewers listed in the foll- ing pages. The papers were selected as a result of conscientious discussion. The program includes two invited talks, by Michel Rabin and Andrew Odlyzko. I would like to express my gratitude to the Program Committee members, whowereenthusiasticfromtheverybeginningofthis completedproject.Thanks also to the external reviewers including those who completed urgent reviews during the discussion phase. Special thanks to Shai Halevi for providing and maintaining the Web review system. Finally, I would like to thank Burt Kaliski of RSA Laboratories and the Steering Committee for their suggestions and c- tinuous assistance. | ||
650 | 0 | _aCryptography. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aData protection. | |
650 | 0 |
_aElectronic data processing _xManagement. |
|
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer networks . | |
650 | 1 | 4 | _aCryptology. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData and Information Security. |
650 | 2 | 4 | _aIT Operations. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aComputer Communication Networks. |
700 | 1 |
_aAbe, Masayuki. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540693277 |
776 | 0 | 8 |
_iPrinted edition: _z9783540834540 |
830 | 0 |
_aSecurity and Cryptology, _x2946-1863 ; _v4377 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/11967668 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c180866 _d180866 |