Advances in cryptology - EUROCRYPT 96 : [14th] International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12 16, 1996 : proceedings
The EUROCRYPT 96 conference was sponsored by the International Asso- ation for Cryptologic Research (IACR)l, in cooperation with the University of Saragossa. It took place at the Palacio de Congresos in Saragossa, Spain, during May 12-16, 1996. This was the fifteenth annual EUROCRYPT conference (thi...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| coleção: | Lecture notes in computer science
1070 |
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in cryptology, EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, proceedings, Ueli Maurer (ed.), 1996, Berlin, Springer, 1 vol. (XII-416 p.), Lecture notes in computer science, 3-540-61186-X • Advances in Cryptology EUROCRYPT 96, Texte imprimé, 9783662169131 |
Sumário:
- 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.