![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
AUSCRYPT 1992: Gold Coast, Queensland, Australia
- Jennifer Seberry, Yuliang Zheng:
Advances in Cryptology - AUSCRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques, Gold Coast, Queensland, Australia, December 13-16, 1992, Proceedings. Lecture Notes in Computer Science 718, Springer 1993, ISBN 3-540-57220-1
Authentication and Secret Sharing I
- Yvo Desmedt:
Treshold Cryptosystems (invited talk). 3-14 - Leonid M. Tombak, Reihaneh Safavi-Naini:
Authentication Codes with Perfect Protection. 15-26 - Yvo Desmedt, Jennifer Seberry:
Practical Proven Secure Authentication with Arbitration. 27-32
Authentication and Secret Sharing II
- Reihaneh Safavi-Naini, Leonid M. Tombak:
Authentication Codes under Impersonation Attack. 35-47 - Wen-Ai Jackson, Keith M. Martin:
Cumulative Arrays and Geometric Secret Sharing Schemes. 48-55 - Wakaha Ogata
, Kaoru Kurosawa, Shigeo Tsujii:
Nonperfect Secret Sharing Schemes. 56-66 - Michael Bertilsson, Ingemar Ingemarsson:
A Construction of Practical Secret Sharing Schemes using Linear Block Codes. 67-79
Signatures and Hashing Algorithms
- Yuliang Zheng, Josef Pieprzyk, Jennifer Seberry:
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output. 83-104 - Bart Preneel, René Govaerts, Joos Vandewalle:
On the Power of Memory in the Design of Collision Resistant Hash Functions. 105-121 - Thomas Hardjono, Yuliang Zheng
:
A Practical Digital Multisignature Scheme Based on Discrete Logarithms. 122-132 - Lein Harn, Shoubao Yang:
Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party. 133-142
Theory of S-Boxes
- Jennifer Seberry, Xian-Mo Zhang:
Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion. 145-155 - Chris Charnes, Josef Pieprzyk
:
Linear Nonequivalence versus Nonlinearity. 156-164 - John Detombe, Stafford E. Tavares:
Constructing Large Cryptographically Strong S-boxes. 165-181
Cryptanalysis
- Valery I. Korzhik, Viktor Yakovlev
:
Nonasymptotic Estimates of Information Protection Efficiency for the Wire-tape Channel Concept (invited talk). 185-195 - Lars R. Knudsen:
Cryptanalysis of LOKI91. 196-208 - Ed Dawson:
Cryptanalysis of Summation Generator. 209-215
Protocols I
- Chi-Sung Laih, Sung-Ming Yen:
Secure Addition Sequence and Its Applications on the Server-Aided Secret Computation Protocols. 219-230 - Kouichi Sakurai, Toshiya Itoh:
Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. 231-243 - Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta:
A Practical Secret Voting Scheme for Large Scale Elections. 244-251 - Takashi Satoh, Kaoru Kurosawa, Shigeo Tsujii:
Privacy for Multi-Party Protocols. 252-260
Protocolls II
- Jean Claude Paillès:
New Protocols for Electronic Money. 263-274 - Benjamin B. Nieh, Stafford E. Tavares:
Modelling and Analyzing Cryprographic Protocols Using Petri Nets. 275-295 - Tsutomu Matsumoto, Hideki Imai, Chi-Sung Laih, Sung-Ming Yen:
On Verifiable Implicit Asking Protocols for RSA Computation. 296-307 - Chae Hoon Lim, Pil Joong Lee:
Modified Maurer-Yacobi's scheme and its applications. 308-323
Sequences
- Andrew Klapper:
The Vulnerability of Geometric Sequences Based on Fields on Odd Characteristic. 327-338 - Xuejia Lai, Rainer A. Rueppel, Jack Woollven:
A Fast Cryptographic Checksum Algorithm Based on Stream Ciphers. 339-348 - Miodrag J. Mihaljevic:
An Approach to the Initial State Reconstruction of a Clock-Controlled Shift Register Based on a Novel Distance Measure. 349-356 - Jun-Hui Yang, Zong-Duo Dai:
Construction of m-ary de Bruijn Sequences (Extendet abstract). 357-363
Pseudorandomness
- John Snare:
Information Technology Security Standards - An Australian Perspective. 367-384 - Manuel Cerecedo, Tsutomu Matsumoto, Hideki Imai:
Non-Interactive Generation of Shared Pseudorandom Sequences. 385-396 - Michael Portz:
A Generalized Description of DES-based and Benes-based Permutationgenerators. 397-409
Odds and Ends
- Leisa Condie:
Prime Generation with the Demytko-Miller-Trbuvich Algorithm. 413-421 - Alain P. Hiltgen:
Constructions of Freebly-One-Way Families of Permutations. 422-434 - Kouichi Sakurai, Toshiya Itoh:
On Bit Correlations Among Preimages of "Many to One" One-Way Functions. 435-446 - Sung-Ming Yen, Chi-Sung Laih:
The Fast Cascade Exponentation Algorithm and its Applications on Cryptography. 447-456
Public Key Cryptography I
- Chin-Chen Chang, Tzong-Chen Wu, C. P. Chen:
The Design of a Conference Key Distribution System. 459-466 - Edward Zuk:
Remarks on "The Design of a Conference Key Distribution System". 467-468 - Lein Harn, Shoubao Yang:
Public-Key Cryptosystem Based on the Discrete Logarithm Problem. 469-476
Public Key Cryptography II
- Atsuko Miyaji
:
Elliptic Curves over Fp Suitable for Cryptosystems. 479-491 - Christian Waldvogel, James L. Massey:
The Probability Distribution of the Diffie-Hellman Key. 492-504 - Jörg Sauerbrey:
A Modular Exponentiation Unit Based on Systolic Arrays. 505-516 - Christine M. O'Keefe:
A Comparison of Key Distribution Patterns Constructed from Circle Geometries. 517-527
Rump Session
- Mike Rezny, Eddie Trimarchi:
A Block Cipher Method using Combinations of Different Methods under the Control of the User Key. 531-534 - Bart Preneel, René Govaerts, Joos Vandewalle:
An Attack on Two Hash Functions by Zheng-Matsumoto-Imai. 535-538 - Rudolf Lidl, Winfried B. Müller:
Primality Testing with Lucas Functions. 539-542
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.