Topics in Cryptology - CT-RSA 2002 : the Cryptographers Track at the RSA Conference 2002, San Jose, CA, USA, February 18 22, 2002 : proceedings
This volume continues the tradition established in 2001 of publishing the c- tributions presented at the Cryptographers Track (CT-RSA) of the yearly RSA Security Conference in Springer-Verlag s Lecture Notes in Computer Science series. With 14 parallel tracks and many thousands of participants, the...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
2271 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Topics in cryptology, CT-RSA 2002, the Cryptographers' Track at RSA Conference 2002, San Jose, CA, USA, February 18-22, 2002, proceedings, Bart Preneel (ed.), Berlin, Springer, 2002, 1 vol. (X-309 p.), Lecture notes in computer science, 3-540-43224-8 • Topics in Cryptology - CT-RSA 2002, Texte imprimé, 9783662187319 |
Indholdsfortegnelse:
- Public Key Cryptography
- On Hash Function Firewalls in Signature Schemes
- Observability Analysis - Detecting When Improved Cryptosystems Fail -
- Efficient Hardware Implementations
- Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli
- Montgomery in Practice: How to Do It More Efficiently in Hardware
- MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis
- An ASIC Implementation of the AES SBoxes
- Public Key Cryptography: Theory
- On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
- The Representation Problem Based on Factoring
- Symmetric Ciphers
- Ciphers with Arbitrary Finite Domains
- Known Plaintext Correlation Attack against RC5
- E-Commerce and Applications
- Micropayments Revisited
- Proprietary Certificates
- Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption
- Digital Signatures
- RSA-Based Undeniable Signatures for General Moduli
- Co-operatively Formed Group Signatures
- Transitive Signature Schemes
- Homomorphic Signature Schemes
- Public Key Encryption
- GEM: A Generic Chosen-Ciphertext Secure Encryption Method
- Securing Encryption + Proof of Knowledge in the Random Oracle Model
- Discrete Logarithm
- Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture
- Secure Key-Evolving Protocols for Discrete Logarithm Schemes.