default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 1992: Balatonfüred, Hungary
- Rainer A. Rueppel:
Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings. Lecture Notes in Computer Science 658, Springer 1993, ISBN 3-540-56413-6
Secret Sharing
- Carlo Blundo, Alfredo De Santis, Douglas R. Stinson, Ugo Vaccaro:
Graph Decompositions and Secret Sharing Schemes. 1-24 - Yair Frankel, Yvo Desmedt:
Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract). 25-34
Hash Functions
- Thierry Baritaud, Henri Gilbert, Marc Girault:
FFT Hashing is not Collision-free. 35-44 - Claus-Peter Schnorr:
FFT-Hash II, Efficient Cryptographic Hashing. 45-54 - Xuejia Lai, James L. Massey:
Hash Function Based on Block Ciphers. 55-70 - Thomas A. Berson:
Differential Cryptanalysis Mod 2^32 with Applications to MD5. 71-80
Block Ciphers
- Mitsuru Matsui, Atsuhiro Yamagishi:
A New Method for Known Plaintext Attack of FEAL Cipher. 81-91 - Kaisa Nyberg:
On the Construction of Highly Nonlinear Permutations. 92-98 - Ralph Wernsdorf:
The One-Round Functions of the DES Generate the Alternating Group. 99-112
Stream Ciphers
- Jovan Dj. Golic:
Correlation via Linear Sequential Circuit Approximation of Combiners with memory. 113-123 - Miodrag J. Mihaljevic, Jovan Dj. Golic:
Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift register Sequence. 124-137 - Luke O'Connor, Tim Snider:
Suffix Tree and String Complexity. 138-152
Public Key I
- Birgit Pfitzmann, Michael Waidner
:
Attacks on Protocols for Server-Aided RSA Computation. 153-162 - Greg Harper, Alfred Menezes, Scott A. Vanstone:
Public-Key Cryptosystems with Very Small Key Length. 163-173 - Jörg Sauerbrey, Andreas Dietel:
Resource Requirements for the Application of Addition Chains in Modulo Exponentiation. 174-182
Factoring
- Brandon Dixon, Arjen K. Lenstra:
Massively Parallel Elliptic Curve Factorin. 183-193
Panel
- Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid:
The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). 194-199
Public Key II
- Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson:
Fast Exponentiation with Precomputation (Extended Abstract). 200-207 - Michael J. Beller, Yacov Yacobi:
Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications. 208-220 - Keiichi Iwamura, Tsutomu Matsumoto, Hideki Imai:
High-Speed Implementation Methods for RSA Scheme. 221-238
Pseudo-random Permutation Generators
- Ueli M. Maurer:
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator. 239-255 - Jacques Patarin:
How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function. 256-266 - Babak Sadeghiyan, Josef Pieprzyk:
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function. 267-284
Complexity Theory and Cryptography I
- Donald Beaver:
How to Break a "Secure" Oblivious Transfer Protocol. 285-296 - Paul Barbaroux:
Uniform Results in Polynomial-Time Security. 297-306 - Donald Beaver, Stuart Haber:
Cryptographic Protocols Provably Secure Against Dynamic Adversaries. 307-323
Zero-Knowledge
- Kazuo Ohta, Tatsuaki Okamoto, Atsushi Fujioka:
Secure Bit Commitment Function against Divertibility. 324-340 - Ivan Damgård:
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing. 341-355 - Ingrid Biehl, Johannes A. Buchmann, Bernd Meyer, Christian Thiel, Christoph Thiel:
Tools for Proving Zero Knowledge. 356-365
Digital Signatures and Electronic Cash
- Eugène van Heyst, Torben P. Pedersen:
How to Make Efficient Fail-stop Signatures. 366-377 - Jan-Hendrik Evertse, Eugène van Heyst:
Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol? 378-389 - David Chaum, Torben P. Pedersen:
Transferred Cash Grows in Size. 390-407
Complexity Theory and Cryptography II
- Harald Niederreiter, Claus-Peter Schnorr:
Local Randomness in Candidate One-Way Functions. 408-419 - Tatsuaki Okamoto, Kouichi Sakurai, Hiroki Shizuya:
How Intractable Is the Discrete Logarithm for a General Finite Group? 420-428 - Ueli M. Maurer:
Factoring with an Oracle. 429-436
Applications
- Rafi Heiman:
Secure Audio Teleconferencing: A Practical Solution. 437-448
Selected Papers from the Rump Session
- Kenji Koyama:
Secure Conference Key Distribution Schemes for Conspiracy Attack. 449-453 - Rafi Heiman:
A Note on Discrete Logorithms with Special Structure. 454-457 - Ueli M. Maurer, Yacov Yacobi:
A Remark on a Non-interactive Public-Key Distribution System. 458-460 - Lidong Chen, Ivan Damgård:
Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract). 461-466 - Andrea Sgarro:
Information-Theoretic Bounds for Authentication Frauds. 467-471 - Jovan Dj. Golic, Slobodan V. Petrovic:
A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance. 472-476 - Keiichi Iwamura, Tsutomu Matsumoto, Hideki Imai:
Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract). 477-481 - Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
On the Development of a Fast Elliptic Curve Cryptosystem. 482-487 - David Naccache:
A Montgomery-Suitable Fiat-Shamir-like Authenication Scheme. 488-491
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.
last updated on 2024-12-27 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
