Advances in Cryptology – EUROCRYPT 2004
Springer Berlin (Verlag)
978-3-540-21935-4 (ISBN)
Private Computation.- Efficient Private Matching and Set Intersection.- Positive Results and Techniques for Obfuscation.- Secure Computation of the k th -Ranked Element.- Signatures I.- Short Signatures Without Random Oracles.- Sequential Aggregate Signatures from Trapdoor Permutations.- Unconditional Security.- On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission.- The Exact Price for Unconditionally Secure Asymmetric Cryptography.- On Generating the Initial Key in the Bounded-Storage Model.- Distributed Cryptography.- Practical Large-Scale Distributed Key Generation.- Optimal Communication Complexity of Generic Multicast Key Distribution.- Foundations I.- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem.- Black-Box Composition Does Not Imply Adaptive Security.- Identity-Based Encryption.- Chosen-Ciphertext Security from Identity-Based Encryption.- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles.- Elliptic Curves.- Construction of Secure Random Curves of Genus 2 over Prime Fields.- Projective Coordinates Leak.- Signatures II.- Security Proofs for Identity-Based Identification and Signature Schemes.- Concurrent Signatures.- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures.- Public-Key Cryptography.- Public-Key Steganography.- Immunizing Encryption Schemes from Decryption Errors.- Secure Hashed Diffie-Hellman over Non-DDH Groups.- Foundations II.- On Simulation-Sound Trapdoor Commitments.- Hash Function Balance and Its Impact on Birthday Attacks.- Multiparty Computation.- Multi-party Computation with Hybrid Security.- On the Hardness of Information-Theoretic Multiparty Computation.- Dining Cryptographers Revisited.-Cryptanalysis.- Algebraic Attacks and Decomposition of Boolean Functions.- Finding Small Roots of Bivariate Integer Polynomial Equations Revisited.- New Applications.- Public Key Encryption with Keyword Search.- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data.- Algorithms and Implementation.- Merkle Tree Traversal in Log Space and Time.- Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3.- Anonymity.- Traceable Signatures.- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme.- Anonymous Identification in Ad Hoc Groups.
Erscheint lt. Verlag | 22.4.2004 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 630 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 170 x 244 mm |
Gewicht | 870 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • algorithms • anonimity • biometric anthentication • Communication • Complexity • Cryptanalysis • cryptography • Cryptology • data encryption • Data Security • Digital Signature Systems • Elliptic Curve Cryptography • group communications • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information • Information Security • Kryptographie / Kryptologie • Oracle • privacy • Public Key Cryptography • security |
ISBN-10 | 3-540-21935-8 / 3540219358 |
ISBN-13 | 978-3-540-21935-4 / 9783540219354 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich