Information security and privacy : 7th Australasian Conference, ACISP 2002 Melbourne, Australia, July 3 5, 2002 : proceedings
The Seventh Australasian Conference in Information Security and Privacy (ACISP) was held in Melbourne, 3 5July, 2002. The conference was sponsored by Deakin University and iCORE, Alberta, Canada and the Australian Com- ter Society. The aims of the annual ACISP conferences have been to bring together...
সংরক্ষণ করুন:
| সংস্থা লেখক: | |
|---|---|
| অন্যান্য লেখক: | , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
2384 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Information security and privacy, 7th Australasian Conference, ACISP 2002, Melbourne, Australia, July 3-5, 2002, Proceedings, Lynn Batten, Jennifer Seberry, eds, Berlin, Springer, 2002, 1 vol. (XII-514 p.), Lecture notes in computer science, 3-540-43861-0 • Information Security and Privacy, Texte imprimé, 9783662171110 |
সূচিপত্রের সারণি:
- Key Handling
- A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields
- Security Analysis and Improvement of the Global Key Recovery System
- The LILI-II Keystream Generator
- A Secure Re-keying Scheme with Key Recovery Property
- Trust and Secret Sharing
- Modelling Trust Structures for Public Key Infrastructures
- Size of Broadcast in Threshold Schemes with Disenrollment
- Requirements for Group Independent Linear Threshold Secret Sharing Schemes
- Efficient Sharing of Encrypted Data
- Cheating Prevention in Linear Secret Sharing
- Fast Computation
- Note on Fast Computation of Secret RSA Exponents
- Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
- Cryptanalysis I
- Cryptanalysis of Stream Cipher COS (2, 128) Mode I
- The Analysis of Zheng-Seberry Scheme
- Cryptanalysis of Stream Cipher Alpha1
- A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem
- Elliptic Curves
- Isomorphism Classes of Hyperelliptic Curves of Genus 2 over
- Compact Representation of Domain Parameters of Hyperelliptic Curve Cryptosystems
- A New Elliptic Curve Scalar Multiplication Algorithm to Resist Simple Power Analysis
- AES
- Strengthening the Key Schedule of the AES
- On the Necessity of Strong Assumptions for the Security of a Class of Asymmetric Encryption Schemes
- Security Management
- Security Management: An Information Systems Setting
- Resolving Conflicts in Authorization Delegations
- Policy Administration Domains
- Authentication
- Maintaining the Validity of Digital Signatures in B2B Applications
- Short 3-Secure Fingerprinting Codes for Copyright Protection
- An Order-Specified Multisignature Scheme Secure against Active Insider Attacks
- Authenticated Operation of Open Computing Devices
- A New Identification SchemeBased on the Bilinear Diffie-Hellman Problem
- Invited Talk
- A Brief Outline of Research on Correlation Immune Functions
- Oblivious Transfer
- m out of n Oblivious Transfer
- Cryptanalysis II
- On the Security of Reduced Versions of 3-Pass HAVAL
- On Insecurity of the Side Channel Attack Countermeasure Using Addition-Subtraction Chains under Distinguishability between Addition and Doubling
- On the Security of a Modified Paillier Public-Key Primitive
- Dealing with Adversaries
- How to Play Sherlock Holmes in the World of Mobile Agents
- A Practical Approach Defeating Blackmailing
- Privacy against Piracy: Protecting Two-Level Revocable P-K Traitor Tracing
- Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries.