Advances in Cryptology - EUROCRYPT '99
Subtitle: International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May ... (Lecture Notes in Computer Science)
Edition: 1 edition
Publisher: Springer
Published: May 14, 1999
Language: eng
Format: Paperback
Number of pages: 500
ISBN-13: 9783540658894
Subjects: Data security & data encryption; General; Cryptography/Access Control; Computers; Computers - Computer Security; Computer Books: General; Security; Computer Science; Security - General; Computers / Security; Computers-Computer Science; Cryptography; Data encryption (Computer science); Medical-General; Computers - General Information
First sentence: To provide fast RSA signature generation one is tempted to use a small private exponent d.
Description: Advances in Cryptology — EUROCRYPT ’99: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2–6, 1999 Proceedings<br />Author: Jacques Stern<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-65889-4<br /> DOI: 10.1007/3-540-48910-X<br /><br />Table of Contents:<p></p><ul><li>Cryptanalysis of RSA with Private Key d Less than N
</li><li>Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
</li><li>Software Performance of Universal Hash Functions
</li><li>Lower Bounds for Oblivious Transfer Reductions
</li><li>On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
</li><li>Conditional Oblivious Transfer and Timed-Release Encryption
</li><li>An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
</li><li>Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
</li><li>Secure Hash-and-Sign Signatures Without the Random Oracle
</li><li>A Note on the Limits of Collusion-Resistant Watermarks
</li><li>Coin-Based Anonymous Fingerprinting
</li><li>On the Performance of Hyperelliptic Cryptosystems
</li><li>Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
</li><li>Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
</li><li>Unbalanced Oil and Vinegar Signature Schemes
</li><li>Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
</li><li>New Public Key Cryptosystems Based on the Dependent-RSA Problems
</li><li>Resistance Against General Iterated Attacks
</li><li>XOR and Non-XOR Differential Probabilities
</li><li>S-boxes with Controllable Nonlinearity</li></ul>