


default search action
Journal of Cryptology, Volume 13
Volume 13, Number 1, 2000
- Oded Goldreich:

Preface. 1-7 - Matthew K. Franklin, Rebecca N. Wright:

Secure Communication in Minimal Connectivity Models. 9-30 - Martin Hirt, Ueli M. Maurer:

Player Simulation and General Adversary Structures in Perfect Multiparty Computation. 31-60 - Ran Canetti, Shai Halevi, Amir Herzberg

:
Maintaining Authenticated Communication in the Presence of Break-Ins. 61-105 - Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky

, Adi Rosén:
Randomness versus Fault-Tolerance. 107-142 - Ran Canetti:

Security and Composition of Multiparty Cryptographic Protocols. 143-202
Volume 13, Number 2, 2000
- Hugo Zbinden, Nicolas Gisin, Bruno Huttner, Antoine Muller

, Wolfgang Tittel
:
Practical Aspects of Quantum Cryptographic Key Distribution. 207-220 - Roger Fischlin, Claus-Peter Schnorr:

Stronger Security Proofs for RSA and Rabin Bits. 221-244 - Jovan Dj. Golic, Mahmoud Salmasizadeh, Ed Dawson

:
Fast Correlation Attacks on the Summation Generator. 245-262 - Sachar Paulus, Tsuyoshi Takagi:

A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time. 263-272 - Rosario Gennaro, Tal Rabin, Stanislaw Jarecki, Hugo Krawczyk:

Robust and Efficient Sharing of RSA Functions. 273-300
Volume 13, Number 3, 2000
- Muxiang Zhang:

Maximum Correlation Analysis of Nonlinear Combining Functions in Stream Ciphers. 301-314 - Erez Petrank, Charles Rackoff:

CBC MAC for Real-Time Data Sources. 315-338 - Don Coppersmith, Igor E. Shparlinski:

On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping. 339-360 - David Pointcheval

, Jacques Stern:
Security Arguments for Digital Signatures and Blind Signatures. 361-396
Volume 13, Number 4, 2000
- Rosario Gennaro, Tal Rabin, Hugo Krawczyk:

RSA-Based Undeniable Signatures. 397-416 - Lars R. Knudsen:

A Detailed Analysis of SAFER K. 417-436 - John M. Pollard:

Kangaroos, Monopoly and Discrete Logarithms. 437-447 - Joan Boyar

, Ivan Damgård, René Peralta
:
Short Non-Interactive Cryptographic Proofs. 449-472 - Michael J. Jacobson Jr.:

Computing Discrete Logarithms in Quadratic Orders. 473-492

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














