Advances in Cryptology — CRYPTO ’95
Springer Berlin (Verlag)
978-3-540-60221-7 (ISBN)
MAC and Hash.- MDx-MAC and Building Fast MACs from Hash Functions.- XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions.- Bucket Hashing and its Application to Fast Message Authentication.- Number Theory I.- Fast Key Exchange with Elliptic Curve Systems.- Fast Server-Aided RSA Signatures Secure Against Active Attacks.- Security and Performance of Server-Aided RSA Computation Protocols.- Oblivious Transfer.- Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver.- Precomputing Oblivious Transfer.- Committed Oblivious Transfer and Private Multi-Party Computation.- On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols.- Cryptanalysis I.- How to Break Shamir's Asymmetric Basis.- On the Security of the Gollmann Cascades.- Improving the Search Algorithm for the Best Linear Expression.- On Differential and Linear Cryptanalysis of the RC5 Encryption Algorithm.- Key Escrow.- A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow Systems.- A Key Escrow System with Warrant Bounds.- Fair Cryptosystems, Revisited.- Escrow Encryption Systems Visited: Attacks, Analysis and Designs.- Protocols.- Robustness Principles for Public Key Protocols.- Cryptanalysis II.- Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88.- Cryptanalysis Based on 2-Adic Rational Approximation.- A Key-schedule Weakness in SAFER K-64.- Cryptanalysis of the Immunized LL Public Key Systems.- Zero Knowledge, Interactive Protocols.- Secure Signature Schemes based on Interactive Protocols.- Improved Efficient Arguments.- Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs.- Secret Sharing.- Proactive Secret Sharing Or: How to Cope WithPerpetual Leakage.- Secret Sharing with Public Reconstruction.- On General Perfect Secret Sharing Schemes.- Number Theory II.- NFS with Four Large Primes: An Explosive Experiment.- Some Remarks on Lucas-Based Cryptosystems.- Secret Sharing II.- Threshold DSS Signatures without a Trusted Party.- t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes.- Everything Else.- Quantum Cryptanalysis of Hidden Linear Functions.- An Efficient Divisible Electronic Cash Scheme.- Collusion-Secure Fingerprinting for Digital Data.
Erscheint lt. Verlag | 16.8.1995 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 466 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 632 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | Algorithm analysis and problem complexity • Algorithmische Zahlentheorie • authentication • Authentizität • combinatorics • Communication Protocols • Computational Number Theory • Cryptanalysis • Cryptoanalysis • Cryptology • Key Escrow • Kommunikationsprotokoll • Kommunikationsprotokolle • Kryptoanalysis • Kryptographie / Kryptologie • Schlüsselhinterleg • Schlüsselhinterlegung |
ISBN-10 | 3-540-60221-6 / 3540602216 |
ISBN-13 | 978-3-540-60221-7 / 9783540602217 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich