| Description |
1 online resource : v.: digital |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 1070 |
|
Lecture notes in computer science ; 1070. 0302-9743
|
| Contents |
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 in Length-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 |
| Summary |
This book constitutes the refereed proceedings of EUROCRYPT '96, the 1996 International Conference on the Theory and Application of Cryptographic Techniques, held in Saragossa, Spain, in May 1996, under the sponsorship of the International Association for Cryptologic Research (IACR). The book contains revised versions of the 34 papers selected from a total of 126 submissions. All current aspects of the booming area of cryptologic research and advanced applications are addressed. There are sections on cryptanalysis, public key cryptosystems, new schemes and protocols, multi-party computation, proofs of knowledge, number theory and algorithms, secret sharing, pseudorandomness, cryptographic functions, key management and identification schemes, and digital signature schemes |
| Bibliography |
Includes bibliographical references and index |
| Subject |
Computer science.
|
|
Computer Communication Networks
|
|
Operating systems (Computers)
|
|
Data encryption (Computer science)
|
|
Coding theory.
|
|
Computer software.
|
|
Algorithms.
|
|
Electronic data processing.
|
|
Computer programs.
|
|
Computer algorithms.
|
|
computer science.
|
|
data processing.
|
|
operating systems.
|
|
software.
|
|
algorithms.
|
|
Electronic data processing
|
|
Computer programs
|
|
Computer algorithms
|
|
Algorithms
|
|
Coding theory
|
|
Computer science
|
|
Computer software
|
|
Data encryption (Computer science)
|
|
Operating systems (Computers)
|
| Form |
Electronic book
|
| Author |
Maurer, Ueli.
|
| ISBN |
9783540683391 |
|
3540683399 |
|
354061186X |
|
9783540611868 |
|
