year |
venue |
title |
pages |
1991 | asiacrypt | On Oblivious Transfer Protocol and Its Application for the Exchange of Secrets | 312-320 |
1991 | asiacrypt | Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract) | 412-426 |
1991 | asiacrypt | Limitations of the Even-Mansour Construction | 495-498 |
1991 | asiacrypt | Speeding up Prime Number Generation | 440-449 |
1991 | asiacrypt | The Data Base of Selected Permutations (Extended Abstract) | 73-81 |
1991 | asiacrypt | Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption) | 489-492 |
1991 | asiacrypt | A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract) | 237-246 |
1991 | asiacrypt | Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI | 36-50 |
1991 | asiacrypt | Generalized Threshold Cryptosystems | 159-166 |
1991 | asiacrypt | Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence | 450-459 |
1991 | asiacrypt | Construction of DES-like S-boxes Based on Boolean Functions Satisfyieng the SAC | 59-72 |
1991 | asiacrypt | On Claw Free Families | 111-123 |
1991 | asiacrypt | A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme | 139-148 |
1991 | asiacrypt | A Generalized Secret Sharing Scheme With Cheater Detection | 149-158 |
1991 | asiacrypt | An Extensin of Zero-Knowledge Proofs and Its Applications | 368-381 |
1991 | asiacrypt | Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91 | 477-480 |
1991 | asiacrypt | Optima Perfect Randomizers | 225-236 |
1991 | asiacrypt | Extended Majority Voting and Private-Key Algebraic-Code Encryptions | 288-298 |
1991 | asiacrypt | A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton | 82-96 |
1991 | asiacrypt | The Transition from Mechanisms to Electronic Computers, 1940 to 1950 | 1-21 |
1991 | asiacrypt | Research Activities on Cryptology in Korea | 179-193 |
1991 | asiacrypt | Cryptography and Machine Learning | 427-439 |
1991 | asiacrypt | On NIST's Proposed Digital Signature Standard | 481-484 |
1991 | asiacrypt | On Ordinary Elliptic Curve Cryptosystems | 460-469 |
1991 | asiacrypt | An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth Numbers | 360-367 |
1991 | asiacrypt | A Method to Estimate the Number of Ciphertext Pairs for Differential Cryptanalysis | 51-58 |
1991 | asiacrypt | On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations | 194-209 |
1991 | asiacrypt | IC-Cards and Telecommunication Services | 253-264 |
1991 | asiacrypt | How to Construct A Family of Strong One Way Permutations | 97-110 |
1991 | asiacrypt | Privacy, Cryptographic Pseudonyms, and The State of Health | 493-494 |
1991 | asiacrypt | A Construction of a Cioher From a Single Pseudorandom Permutation | 210-224 |
1991 | asiacrypt | Feistel Type Authentication Codes | 170-178 |
1991 | asiacrypt | A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems | 352-359 |
1991 | asiacrypt | Results of Switching-Closure-Test on FEAL (Extended Abstract) | 247-252 |
1991 | asiacrypt | On the Power of Two-Local Random Reductions | 346-351 |
1991 | asiacrypt | 4 Move Perfect ZKIP of Knowledge with No Assumption | 321-330 |
1991 | asiacrypt | On the Complexity of Constant Round ZKIP of Possession of Knowledge | 331-345 |
1991 | asiacrypt | Any Language in IP Has a Divertable ZKIP | 382-396 |
1991 | asiacrypt | Cryptanalysis of Several Conference Key Distribution Schemes | 265-276 |
1991 | asiacrypt | Cryptanalysis of Another Knapsack Cryptosystem | 470-476 |
1991 | asiacrypt | A Secure Analog Speech Scrambler Using the Discrete Cosine Transform | 299-311 |
1991 | asiacrypt | A Multi-Purpose Proof System - for Identity and Membership Proofs | 397-411 |
1991 | asiacrypt | A Known-Plaintext Attack of FEAL-4 Based on the System of Linear Equations on Difference | 485-488 |
1991 | asiacrypt | Sibling Intractable Function Families and Their Applications (Extended Abstract) | 124-138 |
1991 | asiacrypt | Revealing Information with Partial Period Correlations (Extended Abstract) | 277-287 |
1991 | asiacrypt | Cryptanalysis of LOKI | 22-35 |
1991 | crypto | A One-Round, Two-Prover, Zero-Knowledge Protocol for NP | 213-224 |
1991 | crypto | Epidemiological Models of Computer Viruses | |
1991 | crypto | Functional Inversion and Communication Complexity | 232-241 |
1991 | crypto | Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer | 156-171 |
1991 | crypto | Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract) | 24-43 |
1991 | crypto | A New ID-Based Key Sharing System | 288-299 |
1991 | crypto | Multiparty Secret Key Exchange Using a Random Deal of Cards | 141-155 |
1991 | crypto | A Switching Closure Test to Analyze Cryptosystems | 183-193 |
1991 | crypto | On Correlation-Immune Functions | 86-100 |
1991 | crypto | An Attack on the Last Two Rounds of MD4 | 194-203 |
1991 | crypto | Faster Modular Multiplication by Operand Scaling | 313-323 |
1991 | crypto | Pseudo-random Generators from One-way Functions (Abstract) | 300 |
1991 | crypto | On the Size of Shares for Secret Sharing Schemes | 101-113 |
1991 | crypto | Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer | 470-484 |
1991 | crypto | Universal Electronic Cash | 324-337 |
1991 | crypto | Systematic Design of Two-Party Authentication Protocols | 44-61 |
1991 | crypto | Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems | 267-278 |
1991 | crypto | The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks | 204-212 |
1991 | crypto | Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings | online |
1991 | crypto | New Results on Pseudorandom Permutation Generators Based on the DES Scheme | 301-312 |
1991 | crypto | Exploiting Parallelism in Hardware Implementations of the DES | 367-376 |
1991 | crypto | Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing | 129-140 |
1991 | crypto | How To Break and Repair A "Provably Secure" Untraceable Payment System | 338-350 |
1991 | crypto | Interactive Proofs with Space Bounded Provers | 225-231 |
1991 | crypto | A Calculus for Access Control in Distributed Systems | 1-23 |
1991 | crypto | Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack | 433-444 |
1991 | crypto | A Cryptographic Scheme for Computerized Elections | 405-419 |
1991 | crypto | The Use of Interaction in Public Cryptosystems (Extended Abstract) | 242-251 |
1991 | crypto | CM-Curves with Good Cryptographic Properties | 279-287 |
1991 | crypto | Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks | 445-456 |
1991 | crypto | New Public-Key Schemes Based on Elliptic Curves over the Ring Zn | 252-266 |
1991 | crypto | Shared Generation of Authenticators and Signatures (Extended Abstract) | 457-469 |
1991 | crypto | Practical Quantum Oblivious Transfer | 351-366 |
1991 | crypto | Secure Computation (Abstract) | 392-404 |
1991 | crypto | On Verification in Secret Sharing | 114-128 |
1991 | crypto | Foundations of Secure Interactive Computing | 377-391 |
1991 | crypto | Efficient Multiparty Protocols Using Circuit Randomization | 420-432 |
1991 | crypto | Combinatorial Characterizations of Authentication Codes | 62-73 |
1991 | crypto | Universal Hashing and Authentication Codes | 74-85 |
1991 | crypto | A Known Plaintext Attack of FEAL-4 and FEAL-6 | 172-181 |
1991 | eurocrypt | Dickson Pseudoprimes and Primality Testing | 512-516 |
1991 | eurocrypt | Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application | 114-126 |
1991 | eurocrypt | Differential Cryptanalysis of Feal and N-Hash | 1-16 |
1991 | eurocrypt | Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem | 517-521 |
1991 | eurocrypt | A Comparison of Cryptoanalytic Principles Based on Iterative Error-Correction | 527-531 |
1991 | eurocrypt | Self-Certified Public Keys | 490-497 |
1991 | eurocrypt | On Binary Sequences from Recursions modulo 2e Made Non-Linear by the Bit-by-Bit XOR Function | 200-204 |
1991 | eurocrypt | Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects | 266-280 |
1991 | eurocrypt | Human Identification Through Insecure Channel | 409-421 |
1991 | eurocrypt | New Approaches to the Design of Self-Synchronizing Stream Ciphers | 458-471 |
1991 | eurocrypt | The Automated Cryptoanalysis of Analog Speech Scramblers | 422-430 |
1991 | eurocrypt | Perfect Nonlinear S-Boxes | 378-386 |
1991 | eurocrypt | Hash Functions And Graphs With Large Girths | 508-511 |
1991 | eurocrypt | Some Weaknesses of "Weaknesses of Undeniable Signatures" | 554-556 |
1991 | eurocrypt | The Number of Output Sequences of a Binary Sequence Generator | 160-167 |
1991 | eurocrypt | Enumerating Nondegenerate Permutations | 368-377 |
1991 | eurocrypt | Non-interactive Public-Key Cryptography | 498-507 |
1991 | eurocrypt | Group Signatures | 257-265 |
1991 | eurocrypt | Analysis of Pseudo Random Sequence Generated by Cellular Automata | 186-199 |
1991 | eurocrypt | The Maximum Order Complexity of Sequence Ensembles | 153-159 |
1991 | eurocrypt | Direct Zero Knowledge Proofs of Computational Power in Five Rounds | 96-105 |
1991 | eurocrypt | On A Fast Correlation Attack on Certain Stream Ciphers | 176-185 |
1991 | eurocrypt | The Information Leakage through a Randomly Generated Function | 552-553 |
1991 | eurocrypt | Broadcast Interactive Proofs (Extended Abstract) | 81-95 |
1991 | eurocrypt | A Secret Key Cryptosystem by Iterating a Chaotic Map | 127-140 |
1991 | eurocrypt | Distributed Provers with Applications to Undeniable Signatures | 221-242 |
1991 | eurocrypt | A Threshold Cryptosystem without a Trusted Party (Extended Abstract) | 522-526 |
1991 | eurocrypt | An Iproved Low-Denisty Subset Sum Algorithm | 54-67 |
1991 | eurocrypt | The Knapsack Hash Function proposed at Crypto'89 can be broken | 39-53 |
1991 | eurocrypt | Probabilistic Analysis of Elementary Randimizers | 542-546 |
1991 | eurocrypt | Randomized Authentication Systems | 472-481 |
1991 | eurocrypt | On the Use of Interconnection Networks in Cryptography | 302-315 |
1991 | eurocrypt | Advances in Cryptology - EUROCRYPT '91, Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, April 8-11, 1991, Proceedings | online |
1991 | eurocrypt | On the Reversibility of Oblivious Transfer | 106-113 |
1991 | eurocrypt | Race Integrity Primitives Evaluation (RIPE): A Status Report | 547-551 |
1991 | eurocrypt | Boolean Functions Satisfying Higher Order Propagation Criteria | 141-152 |
1991 | eurocrypt | Discrete Logarithm Based Protocols | 399-408 |
1991 | eurocrypt | Some Considerations concerning the Selection of RSA Moduli | 294-301 |
1991 | eurocrypt | Linear Complexity of Periodically Repeated Random Sequences | 168-175 |
1991 | eurocrypt | Cryptoanalysis of McEliece's Public-Key Cryptosystem | 68-70 |
1991 | eurocrypt | On the Security of the Schnorr Scheme using Preprocessing | 71-80 |
1991 | eurocrypt | How To Broadcast A Secret | 535-541 |
1991 | eurocrypt | On the Complexity of Hyperelliptic Discrete Logarithm Problem | 337-351 |
1991 | eurocrypt | A Formal Approach to Security Architectures | 387-398 |
1991 | eurocrypt | An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks | 352-367 |
1991 | eurocrypt | Non Supersingular Elliptic Curves for Public Key Cryptosystems | 316-327 |
1991 | eurocrypt | A Construction for One Way Hash Functions and Pseudorandom Bit Generators | 431-445 |
1991 | eurocrypt | ESIGN: An Efficient Digital Signature Implementation for Smard Cards | 446-457 |
1991 | eurocrypt | Weakness of Undeniable Signature Schemes (Extended Abstract) | 205-220 |
1991 | eurocrypt | Interactive Bi-Proof Systems and Undeniable Signature Schemes | 243-256 |
1991 | eurocrypt | Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations | 281-293 |
1991 | eurocrypt | Ideals over a Non-Commutative Ring and thier Applications in Cryptology | 482-489 |
1991 | eurocrypt | Markov Ciphers and Differentail Cryptanalysis | 17-38 |
1991 | eurocrypt | Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91 | 532-534 |
1991 | eurocrypt | Building Elliptic Curves Modulo Large Primes | 328-336 |
1991 | jofc | Secure Implementations of Identification Systems | 175-183 |
1991 | jofc | Applying a Formal Analysis Technique to the CCITT X.509 Strong Two-Way Authentication Protocol | 81-98 |
1991 | jofc | Differential Cryptanalysis of DES-like Cryptosystems | 3-72 |
1991 | jofc | Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies | 185-206 |
1991 | jofc | On the Classification of Ideal Secret Sharing Schemes | 123-134 |
1991 | jofc | A Generalized Correlation Attack on a Class of Stream Ciphers Based on the Levenshtein Distance | 201-212 |
1991 | jofc | How to Time-Stamp a Digital Document | 99-111 |
1991 | jofc | One-Way Permutations on Elliptic Curves | 187-199 |
1991 | jofc | Elliptic Curve Implementations of Zero-Knowledge Blobs | 207-213 |
1991 | jofc | On the Chor-Rivest Knapsack Cryptosystem | 149-155 |
1991 | jofc | Key Processing with Control Vectors | 113-136 |
1991 | jofc | Local Randomness in Pseudorandom Sequences | 135-149 |
1991 | jofc | Efficient, Perfect Polynomial Random Number Generators | 157-172 |
1991 | jofc | Bit Commitment Using Pseudorandomness | 151-158 |
1991 | jofc | CRYPTOPOST - A Cryptographic Application to Mail Processing | 137-146 |
1991 | jofc | Efficient Signature Generation by Smart Cards | 161-174 |
1991 | jofc | An Implementation for a Fast Public-Key Cryptosystem | 63-79 |
1991 | jofc | New Bounds and Constructions for Authentication/Secrecy Codes with Splitting | 173-186 |
1991 | jofc | Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority | 75-122 |