Advances in Cryptology - CRYPTO 2004
Springer Berlin (Verlag)
978-3-540-22668-0 (ISBN)
Linear Cryptanalysis.- On Multiple Linear Approximations.- Feistel Schemes and Bi-linear Cryptanalysis.- Group Signatures.- Short Group Signatures.- Signature Schemes and Anonymous Credentials from Bilinear Maps.- Foundations.- Complete Classification of Bilinear Hard-Core Functions.- Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?.- Security of Random Feistel Schemes with 5 or More Rounds.- Efficient Representations.- Signed Binary Representations Revisited.- Compressed Pairings.- Asymptotically Optimal Communication for Torus-Based Cryptography.- How to Compress Rabin Ciphertexts and Signatures (and More).- Public Key Cryptanalysis.- On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.- Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.- Zero-Knowledge.- Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks.- Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model.- Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks.- The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols.- Hash Collisions.- Near-Collisions of SHA-0.- Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions.- Secure Computation.- Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography.- Round-Optimal Secure Two-Party Computation.- Invited Talk.- Security, Liberty, and Electronic Communications.- Stream Cipher Cryptanalysis.- An Improved Correlation Attack Against Irregular Clocked and Filtered Keystream Generators.- Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers.-Faster Correlation Attack on Bluetooth Keystream Generator E0.- Public Key Encryption.- A New Paradigm of Hybrid Encryption Scheme.- Secure Identity Based Encryption Without Random Oracles.- Bounded Storage Model.- Non-interactive Timestamping in the Bounded Storage Model.- Key Management.- IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange.- Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.- Efficient Tree-Based Revocation in Groups of Low-State Devices.- Computationally Unbounded Adversaries.- Privacy-Preserving Datamining on Vertically Partitioned Databases.- Optimal Perfectly Secure Message Transmission.- Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness.
Erscheint lt. Verlag | 4.8.2004 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XI, 582 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 880 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • authentication • Bluetooth • Cryptanalysis • cryptographic protocols • cryptography • Cryptology • Cryptosystems • Database • data encryption • Digital Signatures • finite field • group computation • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Kryptographie / Kryptologie • Oracle • privacy • Public Key Cryptography • rsa • security • symmetric cryptography • Variable |
ISBN-10 | 3-540-22668-0 / 3540226680 |
ISBN-13 | 978-3-540-22668-0 / 9783540226680 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich