Applied Cryptography and Network Security
Springer Berlin (Verlag)
978-3-642-13707-5 (ISBN)
Dr. Moti Yung is Senior Researcher at Columbia University and an editor of the International Association for Cryptologic Research's Journal of Cryptology.
Public Key Encryption.- On the Broadcast and Validity-Checking Security of pkcs#1 v1.5 Encryption.- How to Construct Interval Encryption from Binary Tree Encryption.- Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions.- Digital Signature.- Trapdoor Sanitizable Signatures Made Easy.- Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs.- Redactable Signatures for Tree-Structured Data: Definitions and Constructions.- Block Ciphers and Hash Functions.- Impossible Differential Cryptanalysis on Feistel Ciphers with SP and SPS Round Functions.- Multi-trail Statistical Saturation Attacks.- Multiset Collision Attacks on Reduced-Round SNOW 3G and SNOW 3G???.- High Performance GHASH Function for Long Messages.- Side-Channel Attacks.- Principles on the Security of AES against First and Second-Order Differential Power Analysis.- Adaptive Chosen-Message Side-Channel Attacks.- Secure Multiplicative Masking of Power Functions.- Zero Knowledge and Multi-party Protocols.- Batch Groth-Sahai.- Efficient and Secure Evaluation of Multivariate Polynomials and Applications.- Efficient Implementation of the Orlandi Protocol.- Improving the Round Complexity of Traitor Tracing Schemes.- Key Management.- Password Based Key Exchange Protocols on Elliptic Curves Which Conceal the Public Parameters.- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.- Deniable Internet Key Exchange.- Authentication and Identification.- A New Human Identification Protocol and Coppersmith's Baby-Step Giant-Step Algorithm.- Secure Sketch for Multiple Secrets.- A Message Recognition Protocol Based on Standard Assumptions.- Privacy and Anonymity.- Affiliation-Hiding Key Exchange with Untrusted Group Authorities.- Privacy-Preserving Group Discovery with Linear Complexity.- Two New Efficient PIR-Writing Protocols.- Regulatory Compliant Oblivious RAM.- RFID Security and Privacy.- Revisiting Unpredictability-Based RFID Privacy Models.- OnRFID Privacy with Mutual Authentication and Tag Corruption.- Internet Security.- Social Network-Based Botnet Command-and-Control: Emerging Threats and Countermeasures.- COP: A Step toward Children Online Privacy.- A Hybrid Method to Detect Deflation Fraud in Cost-Per-Action Online Advertising.
| Erscheint lt. Verlag | 9.6.2010 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Security and Cryptology |
| Zusatzinfo | XIII, 564 p. 83 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
| Schlagworte | aes • Algorithm analysis and problem complexity • algorithms • authentication • Calculus • Complexity • Cryptanalysis • cryptography • Hardcover, Softcover / Informatik, EDV/Informatik • hash function • RFID • RFID (Radio Frequency Identificatio) • rsa |
| ISBN-10 | 3-642-13707-5 / 3642137075 |
| ISBN-13 | 978-3-642-13707-5 / 9783642137075 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich