Topics in cryptology - CT-RSA 2001 : the Cryptographers' Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001 : proceedings

David Naccache (ed.)

This book constitutes the refereed proceedings of the Cryptographers' Track at RSA Conference 2001, CT-RSA 2001, in San Francisco, CA, USA in April 2001. The 33 revised full papers presented were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on new cryptosystems; RSA; symmetric cryptography; gambling and lotteries; reductions, constructions, and security proofs; flaws and attacks; implementation; multivariate cryptography; number theoretic problems; passwords and credentials; and protocols.

「Nielsen BookData」より

[目次]

  • New Cryptosystems.- Faster Generation of NICE-Schnorr-Type Signatures.- New Key Agreement Protocols in Braid Group Cryptography.- RSA.- Improving SSL Handshake Performance via Batching.- From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes.- An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits.- Symmetric Cryptography.- On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys.- Analysis of SHA-1 in Encryption Mode.- Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays.- Gambling and Lotteries.- Fair e-Lotteries and e-Casinos.- Secure Mobile Gambling.- Reductions, Constructions and Security Proofs.- Formal Security Proofs for a Signature Scheme with Partial Message Recovery.- The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES.- REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform.- Flaws and Attacks.- Security Weaknesses in Bluetooth.- Distinguishing Exponent Digits by Observing Modular Subtractions.- On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC.- Implementation.- Modular Exponentiation on Fine-Grained FPGA.- Scalable Algorithm for Montgomery Multiplication and its Implementation on the Coarse-Grain Reconfigurable Chip.- Software Implementation of the NIST Elliptic Curves Over Prime Fields.- Multivariate Cryptography.- The Security of Hidden Field Equations (HFE).- QUARTZ, 128-Bit Long Digital Signatures.- FLASH, a Fast Multivariate Signature Algorithm.- Number Theoretic Problems.- Analysis of the Weil Descent Attack of Gaudry, Hess and Smart.- Using Fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation.- Passwords and Credentials.- Relying Party Credentials Framework.- Password Authentication Using Multiple Servers.- More Efficient Password-Authenticated Key Exchange.- Protocols I.- Improved Boneh-Shaw Content Fingerprinting.- Efficient Asymmetric Public-Key Traitor Tracing Without Trusted Agents.- Targeted Advertising ... and Privacy Too.- Protocols II.- Uncheatable Distributed Computations.- Forward-Secure Threshold Signature Schemes.- A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires.

「Nielsen BookData」より

この本の情報

書名 Topics in cryptology - CT-RSA 2001 : the Cryptographers' Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001 : proceedings
著作者等 Cryptographers' Track at RSA Conference
Naccache, David
Moulineaux Issy Ies
シリーズ名 Lecture notes in computer science
出版元 Springer
刊行年月 c2001
ページ数 xii, 471 p.
大きさ 24 cm
ISBN 3540418989
NCID BA51886965
※クリックでCiNii Booksを表示
言語 英語
出版国 ドイツ
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想