Advances in Cryptology - ASIACRYPT 2000 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000 Proceedings /

ASIACRYPT 2000 was the sixth annual ASIACRYPT conference. It was sp- sored by the International Association for Cryptologic Research (IACR) in - operation with the Institute of Electronics, Information, and Communication Engineers (IEICE). The ?rst conference with the name ASIACRYPT took place in 19...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Okamoto, Tatsuaki (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Computer Science, 1976
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • Cryptanalysis I
  • Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
  • Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99
  • Why Textbook ElGamal and RSA Encryption Are Insecure
  • Cryptanalysis of the TTM Cryptosystem
  • Attacking and Repairing Batch Verification Schemes
  • IACR Distinguished Lecture
  • Cryptography Everywhere
  • Digital Signatures
  • Security of Signed ElGamal Encryption
  • From Fixed-Length to Arbitrary-Length RSA Padding Schemes
  • Towards Signature-Only Signature Schemes
  • A New Forward-Secure Digital Signature Scheme
  • Unconditionally Secure Digital Signature Schemes Admitting Transferability
  • Protocols I
  • Efficient Secure Multi-party Computation
  • Mix and Match: Secure Function Evaluation via Ciphertexts
  • A Length-Invariant Hybrid Mix
  • Attack for Flash MIX
  • Distributed Oblivious Transfer
  • Number Theoretic Algorithms
  • Key Improvements to XTR
  • Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
  • Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
  • Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
  • Symmetric-Key Schemes I
  • Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
  • On the Pseudorandomness of Top-Level Schemes of Block Ciphers
  • Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
  • Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography
  • Protocols II
  • Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes
  • Addition of El Gamal Plaintexts
  • Improved Methods to Perform Threshold RSA
  • Commital Deniable Proofs and Electronic Campaign Finance
  • Provably Secure Metering Scheme
  • Invited Lecture
  • CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government
  • Fingerprinting
  • Anonymous Fingerprinting with Direct Non-repudiation
  • Efficient Anonymous Fingerprinting with Group Signatures
  • Zero-Knowledge and Provable Security
  • Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
  • Zero-Knowledge and Code Obfuscation
  • A Note on Security Proofs in the Generic Model
  • Boolean Functions
  • On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
  • Cryptanalysis II
  • Cryptanalysis of the Yi-Lam Hash
  • Power Analysis, What Is Now Possible...
  • Pseudorandomness
  • Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
  • Symmetric-Key Schemes II
  • The Security of Chaffing and Winnowing
  • Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
  • Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
  • Proofs of Security for the Unix Password Hashing Algorithm
  • Public-Key Encryption and Key Distribution
  • Trapdooring Discrete Logarithms on Elliptic Curves over Rings
  • Strengthening McEliece Cryptosystem
  • Password-Authenticated Key Exchange Based on RSA
  • Round-Efficient Conference Key Agreement Protocols with Provable Security.