Topics in Cryptology - CT-RSA 2010 The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Pieprzyk, Josef (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
Σειρά:Lecture Notes in Computer Science, 5985
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03638nam a22005295i 4500
001 978-3-642-11925-5
003 DE-He213
005 20151204152930.0
007 cr nn 008mamaa
008 100306s2010 gw | s |||| 0|eng d
020 |a 9783642119255  |9 978-3-642-11925-5 
024 7 |a 10.1007/978-3-642-11925-5  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.A25 
072 7 |a URY  |2 bicssc 
072 7 |a COM053000  |2 bisacsh 
082 0 4 |a 005.82  |2 23 
245 1 0 |a Topics in Cryptology - CT-RSA 2010  |h [electronic resource] :  |b The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings /  |c edited by Josef Pieprzyk. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2010. 
300 |a 397 p. 43 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5985 
505 0 |a Invited Talk -- The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition -- Public-Key Cryptography -- Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries -- Efficient CRT-RSA Decryption for Small Encryption Exponents -- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine -- Plaintext-Awareness of Hybrid Encryption -- Speed Records for NTRU -- High-Speed Parallel Software Implementation of the ? T Pairing -- Refinement of Miller’s Algorithm Over Edwards Curves -- Probabilistic Public Key Encryption with Equality Test -- Efficient CCA-Secure PKE from Identity-Based Techniques -- Anonymity from Asymmetry: New Constructions for Anonymous HIBE -- Making the Diffie-Hellman Protocol Identity-Based -- On Extended Sanitizable Signature Schemes -- Side-Channel Attacks -- Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks -- Fault Attacks Against emv Signatures -- Revisiting Higher-Order DPA Attacks: -- Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs -- Cryptographic Protocols -- Usable Optimistic Fair Exchange -- Hash Function Combiners in TLS and SSL -- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness -- Cryptanalysis -- Linear Cryptanalysis of Reduced-Round PRESENT -- Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited -- Practical Key Recovery Attack against Secret-IV Edon- -- Rebound Attacks on the Reduced Grøstl Hash Function -- Symmetric Cryptography -- The Sum of CBC MACs Is a Secure PRF -- On Fast Verification of Hash Chains. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computer security. 
650 0 |a Data encryption (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Data Encryption. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Systems and Data Security. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
700 1 |a Pieprzyk, Josef.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642119248 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5985 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-11925-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)