Advances in Cryptology – EUROCRYPT ’96
Springer Berlin (Verlag)
978-3-540-61186-8 (ISBN)
Cryptanalysis I.- Low-Exponent RSA with Related Messages.- Generating EIGamal Signatures Without Knowing the Secret Key.- On the Security of Two MAC Algorithms.- Public Key Cryptosystems.- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms.- A Public Key Cryptosystem Based on Elliptic Curves over ?/n? Equivalent to Factoring.- Public Key Encryption and Signature Schemes Based on Polynomials over ?n.- New Schemes and Protocols.- Multi-Authority Secret-Ballot Elections with Linear Work.- Asymmetric Fingerprinting.- Multi-Party Computation.- Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing.- Efficient Multiplicative Sharing Schemes.- Equivocable Oblivious Transfer.- Proofs of Knowledge.- Short Discreet Proofs.- Designated Verifier Proofs and Their Applications.- Number Theory and Algorithms.- Finding a Small Root of a Univariate Modular Equation.- New Modular Multiplication Algorithms for Fast Modular Exponentiation.- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known.- Secret Sharing.- Publicly Verifiable Secret Sharing.- Optimum Secret Sharing Scheme Secure against Cheating.- Cryptanalysis II.- The Security of the Gabidulin Public Key Cryptosystem.- Non-Linear Approximations in Linear Cryptanalysis.- On the Difficulty of Software Key Escrow.- Pseudorandomness.- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding.- On the Existence of Secure Feedback Registers.- Cryptographic Functions.- Fast Low Order Approximation of Cryptographic Functions.- Construction of t-Resilient Functions over a Finite Alphabet.- Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions.- Foiling Birthday Attacks inLength-Doubling Transformations.- Key Management and Identification Schemes.- Session Key Distribution Using Smart Cards.- On Diffie-Hellman Key Agreement with Short Exponents.- On the Security of a Practical Identification Scheme.- Digital Signature Schemes.- Robust Threshold DSS Signatures.- New Convertible Undeniable Signature Schemes.- Security Proofs for Signature Schemes.- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin.
Erscheint lt. Verlag | 24.4.1996 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 416 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 650 g |
Themenwelt | Informatik ► Netzwerke ► Sicherheit / Firewall |
Informatik ► Theorie / Studium ► Kryptologie | |
Schlagworte | Algorithm analysis and problem complexity • algorithms • Communication Protocols • Cryptanalysis • Cryptoanalysis • cryptographic functions • Cryptology • Cryptosystems • digital signature • digital signature schemes • Elektronische Signaturschemata • Kommunikationsprotokoll • Kryptoanalyse • Kryptographische Funktionen • Public Key Cryptosystems • Public-Key-Kryptosysteme • Secret Sharing • Telecomm • Telecommunication Protocols • Telekommunikationsprotokolle |
ISBN-10 | 3-540-61186-X / 354061186X |
ISBN-13 | 978-3-540-61186-8 / 9783540611868 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich