International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, May 2-6, 1999 Proceedings. — Springer, 1999. — 487 p. — ISBN: 978-3-540-65889-4.
Cryptanalysis of RSA with Private Key d Less than N
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Software Performance of Universal Hash Functions
Lower Bounds for Oblivious Transfer Reductions
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
Conditional Oblivious Transfer and Timed-Release Encryption
An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Secure Hash-and-Sign Signatures Without the Random Oracle
A Note on the Limits of Collusion-Resistant Watermarks
Coin-Based Anonymous Fingerprinting
On the Performance of Hyperelliptic Cryptosystems
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
Unbalanced Oil and Vinegar Signature Schemes
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
New Public Key Cryptosystems Based on the Dependent-RSA Problems
Resistance Against General Iterated Attacks
XOR and Non-XOR Differential Probabilities
S-boxes with Controllable Nonlinearity