default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEUROCRYPT 1989: Houthalen, Belgium
- Jean-Jacques Quisquater, Joos Vandewalle:
Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings. Lecture Notes in Computer Science 434, Springer 1990, ISBN 3-540-53433-4
Public-key Cryptosystems
- Whitfield Diffie:
The Adolescence of Public-Key Cryptography (Abstract). 2 - Zvi Galil, Stuart Haber, Moti Yung:
A Secure Public-key Authentication Scheme. 3-15 - Gilles Brassard:
How to Improve Signature Schemes. 16-22 - Walter J. Jaburek:
A Generalization of El Gamal's Public Key Cryptosystem. 23-28 - Christoph G. Günther:
An Identity-Based Key-Exchange Protocol. 29-37 - Fritz Bauspieß, Hans-Joachim Knobloch:
How to Keep Authenticity Alive in a Computer Network. 38-46 - Hartmut Isselhorst:
The Use of Fractions in Public-Key Cryptosystems. 47-55 - Yair Frankel:
A Practical Protocol for Large Group Oriented Networks. 56-61
Theory
- Sheelagh Lloyd:
Counting Functions Satisfying a Higher Order Strict Avalanche Criterion. 63-74 - George I. Davida, Yvo Desmedt, René Peralta
:
A Key Distribution System Based On Any One-Way Function (Extended Abstract). 75-79 - Josef Pieprzyk:
Non-linearity of Exponent Permutations. 80-92 - Andrea Sgarro:
Informational Divergence Bounds for Authentication Codes. 93-101 - Jean-Jacques Quisquater, Marc Girault:
2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms. 102-109 - Stig Fr. Mjølsnes:
A Simple Technique for Diffusing Cryptoperiods. 110-120
Zero-knowledge Protocols
- Mike Burmester, Yvo Desmedt, Fred Piper, Michael Walker:
A General Zero-Knowledge Scheme (Extended Abstract). 122-133 - Tatsuaki Okamoto, Kazuo Ohta:
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility. 134-148 - Claude Crépeau:
Verifiable Disclosure of Secrets and Applications (Abstract). 150-154 - Joan Boyar, Katalin Friedl, Carsten Lund:
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. 155-172 - Jacques Stern:
An Alternative to the Fiat-Shamir Protocol. 173-180 - Gilles Brassard, Claude Crépeau:
Sorting out Zero-Knowledge. 181-191 - Gilles Brassard, Claude Crépeau, Moti Yung:
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract). 192-195 - Moti Yung:
Zero-Knowledge Proofs of Computational Power (Extended Summary). 196-207 - Bert den Boer:
More Efficient Match-Making and Satisfiability: The Five Card Trick. 208-217
Applications
- André Vandermeulebroecke, Etienne Vanzieleghem, Tony Denayer, Paul G. A. Jespers:
A Single Chip 1024 Bits RSA Processor. 219-236 - Hedwig Cnudde:
Cryptel - The Practical Protection of an Existing Electronic Mail System. 237-242 - Jan Van Auseloos:
Technical Security: The Starting Point. 243-248 - Charles Siuda:
Security in Open Distributed Processing. 249-266 - Joos Vandewalle, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen:
A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation. 267-271
Signature and Untraceability
- Mireille Antoine, Jean-François Brakeland, Marc Eloy, Yves Poullet:
Legal Requirements Facing New Signature Technology. 273-287 - David Chaum:
Online Cash Checks. 288-293 - David Chaum, Bert den Boer, Eugène van Heyst, Stig Fr. Mjølsnes, Adri Steenbeek:
Efficient Offline Electronic Checks (Extended Abstract). 294-301 - Michael Waidner:
Unconditional Sender and Recipient Untraceability in Spite of Active Attacks. 302-319 - Jurjen N. Bos, Bert den Boer:
Detection of Disrupters in the DC Protocol. 320-327
Cryptanalysis
- Philippe Flajolet, Andrew M. Odlyzko:
Random Mapping Statistics. 329-354 - Arjen K. Lenstra, Mark S. Manasse:
Factoring by Electronic Mail. 355-371 - Michael J. Wiener:
Cryptanalysis of Short RSA Secret Exponents (Abstract). 372 - Birgit Pfitzmann, Andreas Pfitzmann:
How to Break the Direct RSA-Implementation of Mixes. 373-381 - Hakon N. Jendal, Yves J. B. Kuhn, James L. Massey:
An Information-Theoretic Treatment of Homophonic Substitution. 382-394 - Peer Wichmann:
Cryptanalysis of a Modified Rotor Machine. 395-402 - Michael Bertilsson, Ernest F. Brickell, Ingemar Ingemarsson:
Cryptanalysis of Video Encryption Based on Space-Filling Curves. 403-411 - Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai:
Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract). 412-422 - Rainer A. Rueppel:
On the Security of Schnorr's Pseudo Random Generator. 423-428 - Jean-Jacques Quisquater, Jean-Paul Delescaille:
How Easy is Collision Search? Application to DES (Extended Summary). 429-434
Sharing and Authentication Schemes
- Gustavus J. Simmons:
Prepositioned Shared Secret and/or Shared Control Schemes. 436-467 - Ernest F. Brickell:
Some Ideal Secret Sharing Schemes. 468-475 - Marijke De Soete, Klaus Vedder, Michael Walker:
Cartesian Authentication Schemes. 476-490 - Albrecht Beutelspacher:
How to Say "No". 491-496 - Philippe Godlewski, Chris J. Mitchell:
Key Minimal Authentication Systems for Unconditional Secrecy. 497-501
Sequences
- Christoph G. Günther:
Parallel Generation of Recurring Sequences. 503-522 - Harald Niederreiter:
Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point. 523-532 - Thomas Beth, Zong-Duo Dai:
On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random. 533-543 - Zong-Duo Dai, Kencheng Zeng:
Feedforward Functions Defined By de Bruijn Sequences. 544-548 - Willi Meier, Othmar Staffelbach:
Nonlinearity Criteria for Cryptographic Functions. 549-562 - Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the Linear Complexity of Feedback Registers (Extended Abstract). 563-570 - Muzhong Wang:
Linear Complexity Profiles and Continued Fractions. 571-585 - Réjane Forré:
A Fats Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences. 586-595
Algorithms
- Johannes Buchmann, Stephan Düllmann, Hugh C. Williams:
On the Complexity and Efficiency of a New Key Exchange System. 597-616 - Colin Boyd:
A New Multiple Key Cipher and an Improved Voting Scheme. 617-625 - François Morain:
Atkin's Test: News From the Front. 626-635 - Ueli M. Maurer:
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity. 636-647
Old Problems
- Yves Duhoux:
Deciphering Bronze Age Scripts of Crete - The Case of Linear A. 649-650
Rump Session (Impromptu Talks)
- Wieb Bosma, Marc-Paul van der Hulst:
Faster Primality Testing (Extended Abstract). 652-656 - Tzonelih Hwang, T. R. N. Rao:
Private-Key Algebraic-Code Cryptosystems with High Information Rates (Extended Abstract). 657-661 - Jean-Jacques Quisquater, André Bouckaert:
Zero-Knowledge Procedures for Confidential Access to Medical Records (Extended Summary). 662-664 - Josep Domingo-Ferrer, Llorenç Huguet i Rotger:
Full Secure Key Exchange and Authentication with no Previously Shared Secrets. 665-669 - Yves Roggeman:
Varying Feedback Shift Registers. 670-679 - Dieter Gollmann, William G. Chambers:
A Cryptanalysis of Stepk, m-Cascades. 680-687 - Claus-Peter Schnorr:
Efficient Identification and Signatures for Smart Cards (Abstract). 688-689 - Michael Waidner, Birgit Pfitzmann:
The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract). 690 - Glyn Carter:
Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences. 691-695 - Lawrence Brown, Jennifer Seberry:
On the Design of Permutation P in DES Type Cryptosystems. 696-705 - Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
A Fast Elliptic Curve Cryptosystem. 706-708
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-11-13 23:35 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:
