Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982.

Introduction

  • Introduction

    Classical Cryptography

  • Cryptology - Methods and Maxims
  • Cryptoanalysis of a Kryha Machine
  • Enigma Variations

    Mathematical Foundations

  • Encrypting by Random Rotations

    Analogue Scrambling Schemes

  • Analog Speech security Systems
  • A voice Scrambling System for Testing and Demonstration
  • The Rating of Understanding in Secure Voice Communication Systems
  • Analysis of Multiple Access Channel using Multiple Level FSK
  • Analog Scrambling by the General Fast Fourier Transform

    Stream Ciphers

  • Stream Ciphers
  • Multiplexed Sequences: Some Properties of the Minimum Polynomial
  • On Using Prime Polynomials in Crypto Generators

    Cryptography in Large Communication Systems

  • Communication Security in Remote controlled Computer Systems
  • Privacy and Data Protection in Medicine

    The Data Encryption Standard

  • Cryptonalysis of the Data Encryption Standard by the Method of Formal Coding
  • Are Big S-Boxes Best
  • The average Cycle size of the Key-Stream in Output Feedback Encipherment

    Authentication Systems

  • Jean-Marie Goethals, Jean-Jacques Quisquater: Authentication Procedures
  • Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem

    The Merkle - Hellman - Scheme

  • A new Algorithm for the Solution of the Knapsack Problem
  • Trapdoors in Knapsack Cryptosystems

    The Rivest-Shamir-Adleman-Scheme

  • Is the RSA Scheme Safe
  • Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel
  • Finite Semigroups and the RSA-Cryptosystem
  • How to Share a Secret

    [Top]

    Advances in Cryptology, Proceedings of CRYPTO '84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings.

    Public Key Cryptosystems and Signatures

  • A Prototype Encryption System Using Public Key
  • A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
  • A Public Key Cryptosystem Based on the Word Problem
  • Efficient Signature Schemes Based on Polynomial Equations
  • Identity-Based Cryptosystems and Signature Schemes
  • A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields
  • Some Public Key Crypto-Functions as Intractable as Factorization

    Cryptosystems and Other Hard Problems

  • Computing Logarithms in GF(2n)
  • Wyner's Analog Encryption Scheme: Results of a Simulation
  • On Rotation Group and Encryption of Analog Signals
  • The History of Book Ciphers
  • An Update on Factorization at Sandia National Laboratories (Abstract)
  • An LSI Digital Encryption Processor (DEP)
  • Efficient Hardware and Software Implementations for the DES
  • Efficient Hardware Implementation of the DES
  • A Self-Synchronizing Cascaded Cipher System With Dynamic Control of Error-Propagation

    Randomness And Its Concomitants

  • Efficient and Secure Pseudo-Random Number Generation
  • An LSI Random Number Generator (RNG)
  • Generalized Linear Threshold Scheme
  • Security of Ramp Schemes
  • A Fast Pseudo Random Permutation Generator With Applications to Cryptology
  • On the Cryptographic Applications of Random Functions
  • An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information

    Analysis and Cryptoanalysis

  • RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure
  • Information Theory Without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects
  • Cryptanalysis of ADFGVX Encipherment Systems (Extended Abstract)
  • Breaking Iterated Knapsacks
  • Dependence of Output on Input in DES: Small Avalanche Characteristics
  • DES Has No Per Round Linear Factors

    Protocols and Authentication

  • A Message Authenticator Algorithm Suitable for A Mainframe Computer
  • Key Management for Secure Electronic Funds Transfer in a Retail Environment
  • Authentication Theory/Coding Theory
  • New Secret Codes Can Prevent a Computerized Big Brother (Abstract)
  • Fair Exchange of Secrets
  • Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game (Extended Abstract)
  • Poker Protocols

    Impromptu Talks

  • A "Paradoxical'"Solution to the Signature Problem (Abstract)
  • Sequence Complexity as a Test for Cryptographic Systems
  • An Update on Quantum Cryptography
  • How to Keep a Secret Alive: Extensible Partial Key, Key Safeguarding, and Threshold Systems

    [Top]

    Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings.

    General Theory

  • Cryptology and Complexity Theories
  • On Cryptosystems Based on Polynomials and Finite Fields
  • Algebraical Structures of Cryptographic Transformations
  • Non-Linear Non-Commutative Functions for Data Integrity
  • Wire-Tap Channel II
  • Equivolcations for Homophonic Ciphers
  • Propagation Characteristics of the DES
  • Linear Ciphers and Random Sequence Generators with Multiple Clocks
  • The Stop-and-Go Generator
  • Pseudo Random Properties of Cascade Connections of Clock Controlled Shift Registers
  • On the Linear Complexity of Cascaded Sequences

    Public-Key Systems

  • RSA-Bits are 0.5 + epsilon Secure
  • On the Number of Close-and-Equal Pairs of Bits in a String
  • Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme
  • A New Trapdoor Knapsack Public-Key Cryptosystem
  • RSA Chips (Past/Present/Future)

    Number Theoretical Papers

  • The Quadratic Sieve Factoring Algorithm
  • Status Report on Factoring (At the Sandia National Laboratories)
  • Strong Primes are Easy to Find
  • Discrete Logarithms in Finite Fields and Their Cryptographic Significance

    Channels

  • User Functions for the Generation and Distribution of Encipherment Keys
  • An Optimal Class of Symmetric Key Generation Systems
  • On the Use of the Binary Multiplying Channel in a Private Communication System
  • Secrecy and Privacy in a Local Area Network Environment
  • The Subliminal Channel and Digital Signature
  • A Provably Secure Oblivious Transfer Protocol
  • On Concurrent Identification Protocols

    Applications

  • Time-division Multiplexing Scramblers: Selecting Permutations and Testing the Systems
  • Security of Transportable Computerized Files
  • Encryption and Key Manaagement for the ECS Satellite Service
  • An Encryption and Authentication Procedure for Telesurveillance Systems
  • A Method of Software Protection Based on the Use of Smart Cards and Cryptographic Techniques

    Smart Cards

  • Smart Card Applications in Security and Data Protection
  • Bull CP8 Smart Card Uses in Cryptology
  • Estimation of Some Encryption Functions Implemented into Smart Cards
  • Smart Cards and Conditional Access

    [Top]

    Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings.

    Signatures and Authentication

  • Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
  • Another Birthday Attack
  • Attacks on Some RSA Signatures
  • An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
  • A Secure Subliminal Channel (?)
  • Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences

    Protocols

  • On the Security of Ping-Pong Protocols when Implemented using the RSA
  • A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
  • A Framework for the Study of Cryptographic Protocols
  • Cheating at Mental Poker
  • Security for the DoD Transmission Control Protocol
  • Symmetric Public-Key Encryption

    Copy Protection

  • Software Protection: Myth or Reality
  • Public Protection of Software
  • Fingerprinting Long Forgiving Messages

    Single Key Cryptology

  • Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers
  • Is DES a Pure Cipher? (Results of More Cycling Experiments on DES)
  • A Layered Approach to the Design of Private Key Cryptosystems
  • Lifetimes of Keys in Cryptographic Key Management Systems
  • Correlation Immunity and the Summation Generator
  • Design of Combiners to Prevent Divide and Conquer Attacks
  • On the Security of DES
  • Information Theory Without the Finiteness Assumption, II: Unfolding the DES

    Two Key Cryptology

  • Analysis of a Public Key Approach Based on Polynomial Substitution
  • Developing an RSA Chip
  • An M³ Public-Key Encryption Scheme
  • Trapdoor Rings and Their Use in Cryptography
  • On Computing Logarithms Over Finite Fields
  • On Using RSA with Low Exponent in a Public Key Network
  • Lenstra's Factorization Method Based on Elliptic Curves
  • Use of Elliptic Curves in Cryptography

    Randomness and Other Problems

  • Cryptography with Cellular Automata
  • Efficient Parallel Pseudo-Random Number Generation
  • How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
  • The Bit Security of Modular Squaring Given Partial Factorization of the Modulos
  • Some Cryptographic Aspects of Womcodes
  • How to Reduce Your Enemy's Information (Extended Abstract)
  • Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him
  • Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis

    Impromptu Talks

  • A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes
  • On the Design of S-Boxes
  • The Real Reason for Rivest's Phenomenon
  • The Importance of "Good" Key Scheduling Schemes (How to Make a Secure DES Scheme with <= 48 Bit Keys)
  • Access Control at the Netherlands Postal and Telecommunications Services

    [Top]

    Advances in Cryptology - EUROCRYPT '85, Workshop on the Theory and Application of of Cryptographic Techniques, Linz, Austria, April 1985, Proceedings.

    History of Cryptography

  • The Contribution of E. B. Fleissner and A. Figl for Today's Cryptography
  • On the History of Cryptography during WW2, and Possible New Directions for Cryptograpic Research

    Public Key Cryptography

  • Efficient Factoring Based on Partial Information
  • A Public-Key Cryptosystem based on Shift Register Sequences
  • A Comment on Niederreiter's Public Key Cryptosystem
  • Implementation Study of Public Key Cryptographic Protection in an Existing Electronic Mail and Document Handling System
  • Cryptanalysis of the Dickson Scheme
  • Simultaneous Security of Bits in the Discrete Log
  • On Public-Key Cryptosystems Built using Polynomial Rings

    Secret Key Cryptography

  • Is the Data Encryption Standard a Group? (Preliminary Abstract)
  • Two New Secret Key Cryptosystems
  • Cryptanalysts Representation of Nonlinearly Filtered ML-Sequences
  • Authorized Writing for "Write-Once" Memories

    Shiftregister Sequences and Related Topics

  • On Functions of Linear Shift Register Sequences
  • On Feedforward Transforms and p-Fold Periodic p-Arrays
  • Generalized Multiplexed Sequences
  • A Note On Sequences Generated by Clock Controlled Shift Registers
  • Using Algorithms as Keys in Stream Ciphers
  • On the Linear Complexity of Combined Shift Register Sequences
  • Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators
  • Linear Complexity and Random Sequences

    Cryptographic Systems and Applications

  • Engineering Secure Information Systems
  • The Chipcard: An Identification Card With Cryptographic Protection
  • Encryption: Needs, Requirements, and SOlutions in Banking Networks
  • The Role of Encipherment Services in Distributed Systems
  • Modelling of Encryption Techniques for Secrecy and Privacy in Multi-User Networks
  • Full Encryption in a Personal Computer System
  • Showing Credentials Without Identification: SIgnatures Transferred Between Unconditionally Unlinkable Pseudonyms
  • Networks Without User Observability: Design Options
  • The Verifiability of Two-Party Protocols
  • The Practice of Authentication
  • Message Protection by Spread Spectrum Modulation in a Packet Voice Radio Link

    [Top]

    Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings.

    Data Encryption Standard

  • Structure in the S-boxes of the DES
  • Cycle Structures of the DES with Weak and Semi-Weak Keys

    Public-Key Cryptography

  • Private-Key Algebraic-Coded Cryptosystems
  • Some Variations on RSA Signatures and Their Security
  • Breaking the Cade Cipher
  • A Modification of a Broken Public-Key Cipher
  • A Pseudo-Random Bit Generator Based on Elliptic Logarithms
  • Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
  • Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference Between DES and RSA?)
  • A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations

    Cryptographic Protocols and Zero-Knowledge Proofs

  • How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design
  • How to Prove Yourself: Practical Solutions to Identification and Signature Problems
  • Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How
  • Demonstrating Possession of a Discrete Logarithm Without Revealing It
  • Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols
  • Zero-Knowledge Simulation of Boolean Circuits
  • All-or-Nothing Disclosure of Secrets
  • A Zero-Knowledge Poker Protocol That Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face

    Secret-Sharing Methods

  • Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing
  • How to Share a Secret with Cheaters
  • Smallest Possible Message Expansion in Threshold Schemes

    Hardware Systems

  • VLSI Implementation of Public-Key Encryption Algorithms
  • Architectures for Exponentiation in GF(2n)
  • Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor

    Software Systems

  • A High Speed Manipulation Detection Code
  • Electronic Funds Transfer Point of Sale in Australia

    Software Protection, Probabilistic Methods, and Other Topics

  • The Notion of Security for Probabilistic Cryptosystems
  • Large-Scale Randomization Techniques
  • On the Linear Span of binary Sequences Obtained from Finite Geometries
  • Some Constructions and Bounds for authentication Codes
  • Towards a Theory of Software Protection

    Informal Contributions

  • Two Observations on Probabilistic Primality Testing
  • Public-Key Registration
  • Is There an ultimate Use of Cryptography
  • Smart Card, a Highly Reliable and Portable Security Device
  • THOMAS - A Complete Single Chip RSA Device

    [Top]

    Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings.

    Communication Networks and Standards

  • Standards for Data Security - A Change of Direction
  • Integrating Cryptography in ISDN

    Protocols

  • Special Uses and Sbuses of the Fiat-Shamir Passport Protocol
  • Direct Minimum-Knowledge Computations
  • Non-Interactive Zero-Knowledge Proof Systems
  • How to Solve any Protocol Problem - An Efficiency Improvement
  • Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
  • Society and Group Oriented Cryptography: A New Concept
  • A Simple and Secure Way to Show the Validity of Your Public Key
  • Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
  • Gradual and Verifiable Release of a Secret
  • Strong Practical Protocols

    Key Distribution Systems

  • Identity-based Conference Key Distribution Systems
  • On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
  • Key Distribution Systems Based on Identification Information
  • Secret Distribution of Keys for Public-Key Systems

    Public Key Systems

  • An Impersonation-Proof Identity Verfication Scheme
  • Arbitration in Tamper Proof Systems
  • Efficient Digital Public-Key Signature with Shadow (Abstract)
  • Security-Related Comments Regarding McEliece's Public-Key Cryptosystem

    Design and Analysis of Cryptographic Systems

  • Components and Cycles of a Random Function
  • Fast Spectral Tests for Measuring Nonrandomness and the DES
  • Other Cycling Tests for DES (Abstract)
  • A Crypto-Engine
  • A Natural Taxonomy for Digital Information Authentication Schemes
  • Analyzing Encryption Protocols Using Formal Verification Authentication Schemes
  • Cryptosystems Based on an Analog of Heat Flow
  • A Combinatorial Approach to Threshold Schemes
  • A Realization Scheme for the Identity-Based Cryptosystem
  • Equivalence Between Two Flavours of Oblivious Transfers
  • A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs

    Applications

  • A Digital Signature Based on a Conventional Encryption Function
  • How to Make Replicated Data Secure
  • A Study of Password Security
  • A Video Scrambling Technique Based On Space Filling Curves
  • Secure Audio Teleconference

    Informal Contributions

  • Attack on the Koyama-Ohta Identity Basedd Key Distribution Scheme
  • On the F-function of FEAL
  • Patterns of Entropy Drop of the Key in an S-Box of the DES
  • The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack
  • On Struik-Tilburg Cryptanalysis of Rao-Nam Scheme
  • A Generalization of Hellman's Extension of Shannon's Approach to Cryptography (Abstract)
  • Multiparty Unconditionally Secure Protocols (Abstract)

    [Top]

    Advances in Cryptology - EUROCRYPT '87, Workshop on the Theory and Application of of Cryptographic Techniques, Amsterdam, The Netherlands, April 13-15, 1987, Proceedings.

    Sequences and Linear Complexity

  • In Memoriam Tore Herlestam (1929 - 1986)
  • Alternating Step Generators Controlled by De Bruijn Sequences
  • Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution
  • Some Remarks on the Cross Correlation Analysis of Pseudo Random Generators
  • Sequences With Almost Perfect Linear Complexity Profile
  • When Shift Registers Clock Themselves
  • Finite State Machine Modelling of Cryptographic Systems in Loops

    Hardware Topics

  • Random Sources for Cryptographic Systems
  • Physical Protection of Cryptographic Devices
  • The RSA Cryptography Processor

    Public Key Topics

  • Extension of Brickell's Algorithm for Breaking High Density Knapsacks
  • On Privacy Homomorphisms (Extended Abstract)
  • An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
  • A Public Key Analog Cryptosystem

    Authentication and Secure Transactions

  • Message Authentication with Arbitration of Transmitter/Receiver Disputes
  • Perfect and Essentially Perfect Authentication Schemes
  • Message Authentication and Dynamic Passwords
  • IC-Cards in High-Security Applications

    Hash Functions and Signatures

  • Collision Free Hash Functions and Public Key Signature Schemes
  • Hash-Functions Using Modulo-N Operations
  • Blinding for Unanticipated Signatures

    Symmetric Ciphers

  • Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers
  • Linear Structures in Blockciphers
  • Fast Data Encipherment Algorithm FEAL

    Symmetric Ciphers

  • Modes of Blockcipher Algorithms and their Protection Against Active Eavesdropping
  • Security Considerations in the Design and Implementation of a new DES chip
  • High-Performance Interface Architectures for Cryptographic Hardware

    [Top]

    Advances in Cryptology - EUROCRYPT '88, Workshop on the Theory and Application of of Cryptographic Techniques, Davos, Switzerland, May 25-27, 1988, Proceedings.

    Key Distribution

  • Key Agreements Based on Function Composition
  • Security of Improved Identity-Based Conference Key Distribution Systems

    Authentication

  • Subliminal-Free Authentication and Signature (Extended Abstract)
  • Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts
  • Authentication Codes with Multiple Arbiters (Extended Abstract)
  • Some Constructions for Authentication-Secrecy Codes
  • Efficient Zero-Knowledge Identification Scheme for Smart Cards

    Signatures

  • A Smart Card Implementation of the Fiat-Shamir Identification Scheme
  • Manipulations and Errors, Detection and Localization
  • Privacy Protected Payments - Realization of a Protocol that Guarantees Payer Anonymity
  • A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Trasmission and Memory
  • A Generalized Birthday Attack

    Protocols

  • An Interactive Data Exchange Protocol Based on Discrete Exponentiation
  • Anonymous and Verifiable Registration in Databases
  • Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA
  • Passports and Visas Versus IDS (Extended Abstract)

    Complexity and Number Theory

  • The Probabilistic Theory of Linear Complexity
  • A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers
  • On the Construction of Random Number Generators and Random Function Generators

    Numerical Methods

  • Factorization of Large Integers on a Massively Parallel Computer
  • A Fast Modular Arithmetic Algorithm Using a Residue Table (Extended Abstract)
  • Fast Exponentiation in GF(2n)
  • Fast RSA-Hardware: Dream or Reality

    Cryptanalysis

  • Properties of the Euler Totient Function Modulo 24 and Some of its Cryptographic Implications
  • An Observation on the Security of McEliece's Public-Key Cryptosystem
  • How to Break Okamoto's Cryptosystem by Reducing Lattice Bases
  • Cryptanalysis of F.E.A.L
  • Fast Correltaion Attacks on Stream Ciphers (Extended Abstract)

    Running-Key Ciphers

  • A New Class of Nonlinear Functions for Running-key Generators (Extended Abstract)
  • Windmill Generators: A Generalization and an Observation of How Many There Are
  • Lock-In Effect in Cascades of Clock-Controlled Shift-Registers
  • Proof of Massey's Conjectured Algorithm
  • Linear Recurring m-Arrays

    Cipher Theory and Threshold

  • Substantial Number of Cryptographic Keys and Its Application to Encryption Designs
  • A Measure of Semiequivocation
  • Some New Classes of Geometric Threshold Schemes

    New Ciphers

  • A Universal Algorithm for Homophonic Coding
  • A New Probabilistic Encryption Scheme
  • Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption
  • Some Applications of Multiple Key Ciphers

    [Top]

    Local Area Network Security, Workshop LANSEC '89, European Institute for System Security (E.I.S.S.), Karlsruhe, FRG, April 3-6, 1989.

    Section I

    Section II

    [Top]

    Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings.

    Cryptographic Primitives

  • Weakening Security Assumptions and Oblivious Transfer (Abstract)
  • Limits on the Provable Consequences of One-way Permutations
  • Generalized Secret Sharing and Monotone Functions

    Zero-Knowledge

  • Everything Provable is Provable in Zero-Knowledge
  • A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
  • Zero-Knowledge With Finite State Verifiers

    Number Theory

  • Intractable Problems in Number Theory
  • A Family of Jacobians Suitable for Discrete Log Cryptosystems
  • Computation of Approximate L-th Roots Modulo n and Application to Cryptography

    Cryptoanalysis

  • On the McEliece Public-Key Cryptosystem
  • A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers

    Pseudorandomness

  • On the Existence of Pseudorandom Generators
  • On the Randomness of Legendre and Jacobi Sequences
  • Efficient, Perfect Random Number Generators

    Signatures and Authentication

  • How To Sign Given Any Trapdoor Function
  • A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
  • A Modification of the Fiat-Shamir Scheme
  • An Improvement of the Fiat-Shamir Identification and Signature Scheme

    On the Theory of Security I

  • A Basic Theory of Public and Private Cryptosystems
  • Proving Security Against Chosen Cyphertext Attacks
  • Non-Interactive Zero-Knowledge with Preprocessing

    On the Theory of Security II

  • The Noisy Oracle Problem
  • On Generating Solved Instances of Computational Problems
  • Bounds and Constructions for Authentication-Secrecy Codes with Splitting

    Protocols

  • Untraceable Electronic Cash
  • Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
  • A Universal Problem in Secure and Verifiable Distributed Computation

    Security Concerns

  • An Abstract Theory of Computer Viruses
  • Abuses in Cryptography and How to Fight Them
  • How to (Really) Share a Secret

    Linear Complexity

  • The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
  • On the Linear Syndrome Method in Cryptoanalysis
  • Aperiodic Linear Complexities of de Bruijn Sequences

    Systems

  • The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Foreward Facilities
  • Speeding Up Secret Computations with Insecure Auxiliary Devices
  • Developing Ethernet Enhanced-Security System
  • A Secure Audio Teleconference System

    Short Rump Session Presentations

  • Diffie-Hillman is as Strong as Discrete Log for Certain Primes
  • Secret Error-Correcting Codes (SECC)
  • The Detection of Cheaters in Threshold Schemes
  • On the Power of 1-way Functions (Abstract)
  • "Practical IP" <= MA
  • Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract)

    [Top]

    Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings.

    Public-key Cryptosystems

  • The Adolescence of Public-Key Cryptography (Abstract)
  • A Secure Public-key Authentication Scheme
  • How to Improve Signature Schemes
  • A Generalization of El Gamal's Public Key Cryptosystem
  • An Identity-Based Key-Exchange Protocol
  • How to Keep Authenticity Alive in a Computer Network
  • The Use of Fractions in Public-Key Cryptosystems
  • A Practical Protocol for Large Group Oriented Networks

    Theory

  • Counting Functions Satisfying a Higher Order Strict Avalanche Criterion
  • A Key Distribution System Based On Any One-Way Function (Extended Abstract)
  • Non-linearity of Exponent Permutations
  • Informational Divergence Bounds for Authentication Codes
  • 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms
  • A Simple Technique for Diffusing Cryptoperiods

    Zero-knowledge Protocols

  • A General Zero-Knowledge Scheme (Extended Abstract)
  • Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
  • Verifiable Disclosure of Secrets and Applications (Abstract)
  • Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
  • An Alternative to the Fiat-Shamir Protocol
  • Sorting out Zero-Knowledge
  • Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract)
  • Zero-Knowledge Proofs of Computational Power (Extended Summary)
  • More Efficient Match-Making and Satisfiability: The Five Card Trick

    Applications

  • A Single Chip 1024 Bits RSA Processor
  • Cryptel - The Practical Protection of an Existing Electronic Mail System
  • Technical Security: The Starting Point
  • Security in Open Distributed Processing
  • A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation

    Signature and Untraceability

  • Legal Requirements Facing New Signature Technology
  • Online Cash Checks
  • Efficient Offline Electronic Checks (Extended Abstract)
  • Unconditional Sender and Recipient Untraceability in Spite of Active Attacks
  • Detection of Disrupters in the DC Protocol

    Cryptanalysis

  • Random Mapping Statistics
  • Factoring by Electronic Mail
  • Cryptanalysis of Short RSA Secret Exponents (Abstract)
  • How to Break the Direct RSA-Implementation of Mixes
  • An Information-Theoretic Treatment of Homophonic Substitution
  • Cryptanalysis of a Modified Rotor Machine
  • Cryptanalysis of Video Encryption Based on Space-Filling Curves
  • Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract)
  • On the Security of Schnorr's Pseudo Random Generator
  • How Easy is Collision Search? Application to DES (Extended Summary)

    Sharing and Authentication Schemes

  • Prepositioned Shared Secret and/or Shared Control Schemes
  • Some Ideal Secret Sharing Schemes
  • Cartesian Authentication Schemes
  • How to Say ``No''
  • Key Minimal Authentication Systems for Unconditional Secrecy

    Sequences

  • Parallel Generation of Recurring Sequences
  • Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point
  • On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random
  • Feedforward Functions Defined By de Bruijn Sequences
  • Nonlinearity Criteria for Cryptographic Functions
  • On the Linear Complexity of Feedback Registers (Extended Abstract)
  • Linear Complexity Profiles and Continued Fractions
  • A Fats Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences

    Algorithms

  • On the Complexity and Efficiency of a New Key Exchange System
  • A New Multiple Key Cipher and an Improved Voting Scheme
  • Atkin's Test: News From the Front
  • Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity

    Old Problems

  • Deciphering Bronze Age Scripts of Crete - The Case of Linear A

    Rump Session (Impromptu Talks)

  • Faster Primality Testing (Extended Abstract)
  • Private-Key Algebraic-Code Cryptosystems with High Information Rates (Extended Abstract)
  • Zero-Knowledge Procedures for Confidential Access to Medical Records (Extended Summary)
  • Full Secure Key Exchange and Authentication with no Previously Shared Secrets
  • Varying Feedback Shift Registers
  • A Cryptanalysis of Stepk, m-Cascades
  • Efficient Identification and Signatures for Smart Cards (Abstract)
  • The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract)
  • Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences
  • On the Design of Permutation P in DES Type Cryptosystems
  • A Fast Elliptic Curve Cryptosystem

    [Top]

    Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings.

    Opening Session

  • Keying the German Navy's Enigma
  • Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context
  • On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

    Why is Cryptography Harder Than It Looks?

  • Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks
  • The use of Encryption in Kerberos for Network Authentication
  • UNIX Password Security - Ten Years Later
  • Practical Problems with a Cryptographic Protection Scheme
  • The Smart Siskette - A Universal User Token and Personal Crypto-Engine

    Pseudo-randomness and Sequences

  • On the Quadratic Spans of Periodic Sequences
  • The Shortest Feedback Shift Register That Can Generate A Given Sequence
  • Perfect Local Randomness in Pseudo-Random Sequences
  • Sparse Pseudorandom Distributions
  • Bit Commitment Using Pseudo-Randomness

    Cryptanalysis and Implementation

  • How to Predict Congruential Generators
  • A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang
  • On the Linear Consistency Test (LCT) in Cryptanalysis with Applications
  • Batch RSA
  • On the Implementation of Elliptic Curve Cryptosystems

    Signature and Authentication I

  • New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs
  • Undeniable Signatures

    Signature and Authentication II

  • A Certified Digital Signature
  • Efficient Identification and Signatures for Smart Cards
  • A Signature with Shared Verification Scheme
  • On-Line/Off-Line Digital Schemes

    Threshold Schemes and Key Management

  • On the Classification of Idea Secret Sharing Schemes
  • Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space
  • Secret Sharing Over Infinite Domains (Extended Abstract)
  • Threshold Cryptosystems
  • Flexible Access Control with Master Keys

    Key Distribution and Network Security

  • Key Distribution Protocol for Digital Mobile Communication Systems
  • A Key Exchange System Based on Real Quadratic Fields
  • On Key Distribution Systems
  • SDNS Architecture and End-to-End Encryption

    Fast Computation

  • A Survey of Hardware Implementation of RSA (Abstract)
  • Modular Exponentiation Using Recursive Sums of Residues
  • A Fast Modular-multiplication Algorithm based on a Higher Radix
  • Addition Chain Heuristics
  • How Easy is Collision Search. New Results and Applications to DES

    Odds and Ends

  • A Design Principle for Hash Functions
  • One Way Hash Functions and DES
  • Properties of Cryptosystem PGM
  • On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
  • Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash

    Zero-Knowledge and Oblivious Transfer

  • Efficient Identification Schemes Using Two Prover Interactive Proofs
  • On the Concrete Complexity of Zero-Knowledge Proofs
  • Zero Knowledge Proofs of Knowledge in Two Rounds
  • Minimum Resource Zero-Knowledge Proofs (Extended Abstract)
  • Non-Interactive Oblivious Transfer and Spplications

    Multiparty Computation

  • Multiparty Protocols Tolerating Half Faulty Processors
  • Controlled Gradual Disclosure Schemes for Random Bits and Their Applications
  • Multiparty Computation with Faulty Majority
  • The Spymasters Double-Agent Problem: Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities

    Rump Session

  • On the Structure of Secret Key Exchange Protocols
  • An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract)
  • An Efficient Software Protection Scheme
  • Good S-Boxes Are Easy To Find
  • Covert Distributed Processing with Computer Viruses
  • Progress in Data Security Standardization
  • The FEAL-8 Cryptosystem and a Call for Attack
  • How to Explain Zero-Knowledge Protocols to Your Children

    [Top]

    Advances in Cryptology - AUSCRYPT '90, International Conference on Cryptology, Sydney, Australia, January 8-11, 1990, Proceedings.

    Public-Key Cryptosystems

    Pseudoranomness And Sequences

    Network Security

    Authentication

    Pseudorandomness And Sequences II

    Block Ciphers

    Zero-Knowledge Protocols

    Theory

    Applications

    Implementations

    Rump Session

    [Top]

    Advances in Cryptology - EUROCRYPT '90, Workshop on the Theory and Application of of Cryptographic Techniques, Aarhus, Denmark, May 21-24, 1990, Proceedings.

    Protocols

  • Yvo Desmedt: All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions
  • On the Importance of Memory Resources in the Security of Key Exchange Protocols
  • Provably Secure Key-Updating Schemes in Identity-Based Systems
  • Oblivous Transfer Protecting Secrecy
  • Public-Randomness in Public Key Cryptography
  • An Interactive Identification Scheme Based on Discrete Logarithms and Factoring

    Number-Theoretic Algorithms

  • Factoring With Two Large Primes
  • Which New RSA Signatures Can Be Computed From Some Given RSA Signatures
  • Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields
  • Distributed Primality Proving and the Primality of (23539+1)/3

    Boolean Functions

  • Properties of Binary Functions
  • How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
  • Constructions of Bent Functions and Difference Sets
  • Propagation Characteristics of Boolean Functions

    Binary Sequences

  • The Linear Complexity Profile and the Jump Complexity of Keystream Sequences
  • Lower Bounds for the Linear Complexity of Sequences over Residue Rings
  • On the Construction of Run Permuted Sequences
  • Correlation Properties of Combiners with Memory in Stream Ciphers
  • Correlation Functions of Geometric Sequences

    Implementations

  • Exponentiating Faster with Addition Chains
  • A Cryptographic Library for the Motorola DSP56000
  • VICTOR an Efficient RSA Hardware Implementation
  • Experimental Quantum Cryptography

    Combinatorial Schemes

  • A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party
  • Lower Bounds for Authentication Codes With Splitting
  • Essentially l-Fold Secure Authentication Systems
  • On the Construction of Authentication Codes With Secrecy and Codes Withstanding Spoofing Attacks of Order L >= 2

    Cryptoanalysis

  • Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers
  • A Known Plaintext Attack on Two-Key Triple Encryption
  • Confirmation that Some Hash Functions Are Not Collision Free
  • Inverting the Pseudo Exponentiation

    New Cryptosystems

  • Cryptosystem for Group Oriented Cryptography
  • A Provably-Secure Strongly-Randomized Cipher
  • General Public Key Residue Cryptosystems and Mental Poker Protocols
  • A Proposal for a New Block Encryption Standard
  • A New Trapdoor in Knapsacks

    Signatures and Authentication

  • On the Design of Provably Secure Cryptographic Hash Functions
  • Fast Signature Generation With a Fiat Shamir-Like Scheme
  • A Remark on a Signature Scheme Where Forgery Can Be Proved
  • Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme
  • Zero-Knowledge Undeniable Signatures
  • Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery"

    Rump Session

  • Software Run-Time Protection: A Cryptographic Issue
  • An Identity-based Identification Scheme Based on Discrete Logarithms Modulo a Composite Number
  • A Noisy Clock-Controlled Shift Register Cryptanalysis Concept Based on Sequence Comparion Approach
  • The MD4 Message Digest Algorithm (Abstract)
  • A Remark on the Efficiency of Identification Schemes
  • On an Implementation of the Mohan-Adiga Algorithm

    [Top]

    Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings.

    Cryptanalysis

  • Differential Cryptanalysis of DES-like Cryptosystems
  • A Statistical Attack of the FEAL-8 Cryptosystem
  • An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications

    Protocols

  • Quantum Bit Commitment and Coin Tossing Protocols
  • Security with Low Communication Overhead
  • Fair Computation of General Functions in Presence of Immoral Majority
  • One-Way Group Actions

    Algebra and Number Theory

  • Solving Large Sparse Linear Systems over Finite Fields
  • On the Computation of Discrete Logarithms in Class Groups
  • Matrix Extensions of the RSA Algorithm
  • Constructing Elliptic Curve Cryptosystems in Characteristic 2

    Signatures and Authentication

  • Identification Tokens - or: Solving the Chess Grandmaster Problem
  • Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract)
  • Convertible Undeniable Signatures
  • Unconditionally Secure Digital Signatures

    Secret Sharing

  • Geometric Shared Secret and/or Shared Control Schemes
  • Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
  • Collective Coin Tossing Without Assumptions nor Broadcasting

    Key Distribution

  • A Key Distribution "Paradox"
  • A Modular Approach to Key Distribution

    Hash Functions

  • Structural Properties of One-way Hash Functions
  • The MD4 Message Digest Algorithm

    Zero-Knowledge

  • Achieving Zero-Knowledge Robustly
  • Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
  • Multi-Language Zero Knowledge Interactive Proof Systems
  • Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
  • Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
  • Interactive Proofs with Provable Security Against Honest Verifiers

    Randomness

  • Adi Shamir: On the Universality of the Next Bit Test
  • A Universal Statistical Test for Random Bit Generators
  • On the Impossibility of Private Key Cryptography with Weakly Random Keys

    Applications

  • How to Time-Stamp a Digital Document
  • How to Utilize the Randomness of Zero-Knowledge Proofs
  • Fast Software Encryption Functions
  • CORSAIR: A SMART Card for Public Key Cryptosystems

    Design and Analysis I

  • Fast Checkers for Cryptography
  • Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S
  • The REDOC II Cryptosystem
  • A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion

    Design and Analysis II

  • A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms
  • Nonlinear Parity Circuits and their Cryptographic Applications
  • Cryptographic Significance of the Carry for Ciphers Based on Integer Addition

    Impromptu Talks

  • Computation of Discrete Logarithms in Prime Fields (Extended Abstract)
  • Systolic Modular Multiplication
  • Finding Four Million Large Random Primes
  • The FEAL Cipher Family
  • Discrete-Log With Compressible Exponents

    [Top]

    Advances in Cryptology - EUROCRYPT '91, Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, April 8-11, 1991, Proceedings.

    Crytanalysis I

  • Differential Cryptoanalysis of Feal and N-Hash
  • Markov Ciphers and Differentail Cryptoanalysis
  • The Knapsack Hash Function proposed at Crypto'89 can be broken

    Cryptanalysis II

  • An Iproved Low-Denisty Subset Sum Algorithm
  • Cryptoanalysis of McEliece's Public-Key Cryptosystem
  • On the Security of the Schnorr Scheme using Preprocessing

    Zero Knowledge and Oblivious Transfer

  • Broadcast Interactive Proofs (Extended Abstract)
  • Direct Zero Knowledge Proofs of Computational Power in Five Rounds
  • On the Reversibility of Oblivious Transfer

    Sequences I

  • Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
  • A Secret Key Cryptosystem by Iterating a Chaotic Map
  • Boolean Functions Satisfying Higher Order Propagation Criteria

    Sequences II

  • The Maximum Order Complexity of Sequence Ensembles
  • The Number of Output Sequences of a Binary Sequence Generator
  • Linear Complexity of Periodically Repeated Random Sequences

    Sequences III

  • On A Fast Correlation Attack on Certain Stream Ciphers
  • Analysis of Pseudo Random Sequence Generated by Cellular Automata
  • On Binary Sequences from Recursions modulo 2e Made Non-Linear by the Bit-by-Bit XOR Function

    Signatures

  • Weakness of Undeniable Signature Schemes (Extended Abstract)
  • Distributed Provers with Applications to Undeniable Signatures
  • Interactive Bi-Proof Systems and Undeniable Signature Schemes
  • Group Signatures

    Theory I

  • Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects
  • Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations
  • Some Considerations concerning the Selection of RSA Moduli
  • On the Use of Interconnection Networks in Cryptography

    Theory II

  • Non Supersingular Elliptic Curves for Public Key Cryptosystems
  • Building Elliptic Curves Modulo Large Primes
  • On the Complexity of Hyperelliptic Discrete Logarithm Problem

    S-Box Criteria

  • An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
  • Enumerating Nondegenerate Permutations
  • Perfect Nonlinear S-Boxes

    Applications I

  • A Formal Approach to Security Architectures
  • Discrete Logarithm Based Protocols
  • Human Identification Through Insecure Channel
  • The Automated Cryptoanalysis of Analog Speech Scramblers

    Applications II

  • A Construction for One Way Hash Functions and Pseudorandom Bit Generators
  • ESIGN: An Efficient Digital Signature Implementation for Smard Cards
  • New Approaches to the Design of Self-Synchronizing Stream Ciphers
  • Randomized Authentication Systems

    Public Key Cryptography

  • Ideals over a Non-Commutative Ring and thier Applications in Cryptology
  • Self-Certified Public Keys
  • Non-interactive Public-Key Cryptography

    Short Papers Presented at the "Rump Session"

  • Hash Functions And Graphs With Large Girths
  • Dickson Pseudoprimes and Primality Testing
  • Equivalent Goppa Codes and Trapdoors to McEliece's Public Key Cryptosystem
  • A Threshold Cryptosystem without a Trusted Party (Extended Abstract)
  • A Comparison of Cryptoanalytic Principles Based on Iterative Error-Correction
  • Cryptoanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91
  • How To Broadcast A Secret
  • Probabilistic Analysis of Elementary Randimizers
  • Race Integrity Primitives Evaluation (RIPE): A Status Report
  • The Information Leakage through a Randomly Generated Function
  • Some Weaknesses of "Weaknesses of Undeniable Signatures"

    [Top]

    [Top]

    Computer Security - ESORICS 92, Second European Symposium on Research in Computer Security, Toulouse, France, November 23-25, 1992, Proceedings.

    Access Control

    Formal Methods

    Invited Talk

    Authentication 1

    Distributed Systems

    Authentication 2

    Database Security

    System Architectures

    Applications

    [Top]

    Advances in Cryptology - EUROCRYPT '92, Workshop on the Theory and Application of of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, Proceedings.

    Secret Sharing

  • Graph Decompositions and Secret Sharing Schemes
  • Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups (Extended Abstract)

    Hash Functions

  • FFT Hashing is not Collision-free
  • FFT-Hash II, Efficient Cryptographic Hashing
  • Hash Function Based on Block Ciphers
  • Differential Cryptanalysis Mod 2^32 with Applications to MD5

    Block Ciphers

  • A New Method for Known Plaintext Attack of FEAL Cipher
  • On the Construction of Highly Nonlinear Permutations
  • The One-Round Functions of the DES Generate the Alternating Group

    Stream Ciphers

  • Correlation via Linear Sequential Circuit Approximation of Combiners with memory
  • Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift register Sequence
  • Suffix Tree and String Complexity

    Public Key I

  • Attacks on Protocols for Server-Aided RSA Computation
  • Public-Key Cryptosystems with Very Small Key Length
  • Resource Requirements for the Application of Addition Chains in Modulo Exponentiation

    Factoring

  • Massively Parallel Elliptic Curve Factorin

    Panel

  • The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel)

    Public Key II

  • Fast Exponentiation with Precomputation (Extended Abstract)
  • Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications
  • High-Speed Implementation Methods for RSA Scheme

    Pseudo-random Permutation Generators

  • A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator
  • How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function
  • A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function

    Complexity Theory and Cryptography I

  • How to Break a "Secure" Oblivious Transfer Protocol
  • Uniform Results in Polynomial-Time Security
  • Cryptographic Protocols Provably Secure Against Dynamic Adversaries

    Zero-Knowledge

  • Secure Bit Commitment Function against Divertibility
  • Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing
  • Tools for Proving Zero Knowledge

    Digital Signatures and Electronic Cash

  • How to Make Efficient Fail-stop Signatures
  • Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol
  • Transferred Cash Grows in Size

    Complexity Theory and Cryptography II

  • Local Randomness in Candidate One-Way Functions
  • How Intractable Is the Discrete Logarithm for a General Finite Group
  • Factoring with an Oracle

    Applications

  • Secure Audio Teleconferencing: A Practical Solution

    Selected Papers from the Rump Session

  • Secure Conference Key Distribution Schemes for Conspiracy Attack
  • A Note on Discrete Logorithms with Special Structure
  • A Remark on a Non-interactive Public-Key Distribution System
  • Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract)
  • Information-Theoretic Bounds for Authentication Frauds
  • A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance
  • Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract)
  • On the Development of a Fast Elliptic Curve Cryptosystem
  • A Montgomery-Suitable Fiat-Shamir-like Authenication Scheme

    [Top]

    Advances in Cryptology - ASIACRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques, Gold Coast, Queensland, Australia, December 13-16, 1992, Proceedings.

    Authentication and Secret Sharing I

    Authentication and Secret Sharing II

    Signatures and Hashing Algorithms

    Theory of S-Boxes

    Cryptanalysis

    Protocols I

    Protocolls II

    Sequences

    Pseudorandomness

    Odds and Ends

    Public Key Cryptography I

    Public Key Cryptography II

    Rump Session

    [Top]

    Advances in Cryptology - ASIACRYPT '91, International Conference on the Theory and Applications of Cryptology, Fujiyoshida, Japan, November 11-14, 1991, Proceedings.

    Invited Lecture I

    Differential Cryptanalysis and DES-Like Cryptosystems

    Hashing and Signature Schemes

    Secret Sharing

    Invited Lecture II

    Block Ciphers - Foundations and Analysis

    Invited Lecture III

    Cryptanalysis and New Ciphers

    Proof Systems and Interactive Protocols I

    Proof Systems and Interactive Protocols II

    Invited Lecture IV

    Public-Key Ciphers - Foundations and Analysis

    Impromptu Talks

    [Top]

    Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings.

    Digital Signatures and Identification I

  • Provably Unforgeable Signatures
  • New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
  • Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
  • An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn

    The Digital Signature Standard

  • Designing and Detecting Trapdoors for Discrete Log Cryptosystems
  • Response to Comments of the NIST Proposed Digital Signature Standard

    Applications and New Problems

  • Wallet Databases with Observers
  • Making Electronic Refunds Safer
  • Fair Public-Key Cryptosystems
  • Pricing via Processing or Combatting Junk Mail

    Secret Sharing I

  • On the Information Rate of Secret Sharing Schemes (Extended Abstract)
  • New General Lower Bounds on the Information Rate of Secret Sharing Schemes
  • Universally Ideal Secret Sharing Schemes (Preliminary Version)

    Theory I

  • Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
  • Low Communication 2-Prover Zero-Knowledge Proofs for NP
  • Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
  • On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)

    Cryptographic Functions

  • On the Design of SP Networks From an Information Theoretic Point of View
  • Partially-Bent Functions

    Digital Signatures and Identification II

  • Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract)
  • On the Security of the Permuted Kernel Identification Scheme

    Computational Number Theory

  • Massively Parallel Computation of Discrete Logarithms
  • A Quadratic Sieve on the n-Dimensional Cube
  • Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
  • Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
  • On Generation of Probable Primes By Incremental Search

    Cryptography Education

  • Kid Krypto

    Theory II

  • On Defining Proofs of Knowledge
  • Pubic Randomness in Cryptography
  • Necessary and Sufficient Conditions For Collision-Free Hashing
  • Certifying Cryptographic Tools: The Case of Trapdoor Permutations

    Key Distribution

  • Protocols for Secret Key Agreement by Public Discussion Based on Common Information
  • Perfectly-Secure Key Distribution for Dynamic Conferences

    DES

  • Differential Cryptanalysis of the Full 16-Round DES
  • Iterative Characteristics of DES and s²-DES
  • DES is not a Group

    Secret Sharing II

  • A High-Speed DES Implementation for Network Applications
  • Threshold Schemes with Disenrollment
  • Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract)

    Rump Session

  • An l-Span Generalized Secret Sharing Scheme
  • Provable Security Against Differential Cryptanalysis
  • Content-Addressable Search Engines and DES-like Systems
  • FFT-Hash-II is not yet Collision-free

    [Top]

    Computer Security and Industrial Cryptography - State of the Art and Evolution, ESAT Course, Leuven, Belgium, May 21-23, 1991.

    Introduction

    Theory

    Applications

    [Top]

    Advances in Cryptology - EUROCRYPT '93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings.

    Authentication

  • On the Relation between A-Codes and Codes Correcting Independent Errors
  • Optimal Authentication Systems

    Public Key

  • Factoring Integers Using SIMD Sieves
  • A New Elliptic Curve Based Analogue of RSA
  • Weakness of a Public-Key Cryptosystem Based on Factorizations of Finite Groups

    Block Ciphers

  • Differentially Uniform Mappings for Cryptography
  • On Almost Perfect Nonlinear Permutations
  • Two New Classes of Bent Functions
  • Boolean Functions Satisfying a Higher Order Strict Avalanche Criterion

    Secret Sharing

  • Size of Shares and Probability of Cheating in Threshold Schemes
  • Nonperfect Secret Sharing Schemes and Matroids

    Stream Ciphers

  • From the Memoirs of a Norwegian Cryptologist
  • On the Linear Complexity of Products of Shift-Register Sequences
  • Resynchronization Weaknesses in Synchronous Stream Ciphers
  • Blind Synchronization of m-Sequnces with Even Span
  • On Constructions and Nonlinearity of Correlation Immune Functions (Extended Abstract)

    Digital Signature

  • Practical and Provably Secure Release of a Secret and Exchange of Signatures
  • Subliminal Communication is Easy Using the DSA
  • Can O.S.S. be Repaired? Proposal for a New Practical Signature Scheme

    Protocols I

  • On a Limitation of BAN Logic
  • Efficient Anonymous Channel and All/Nothing Election Scheme
  • Untransferable Rights in a Client-Independent Server Environment
  • Interactive Hashing Simplifies Zero-Knowledge Protocol Design

    Hash Functions

  • One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract)
  • The Breaking of the AR Hash Function
  • Collisions for the Compressin Function of MD5
  • How to Find and Avoid Collisions for the Knapsack Hash Function

    Payment Systems

  • Single Term Off-Line Coins
  • Improved Privacy in Wallets with Observers (Extended Abstract)
  • Distance-Bounding Protocols (Extended Abstract)

    Cryptoanalysis

  • On the Distribution of Characteristics in Bijective Mappings
  • On the Security of the IDEA Block Cipher
  • Linear Cryptoanalysis Method for DES Cipher
  • New Types of Cryptoanalytic Attacks Using related Keys (Extended Abstract)

    Protocols II

  • Secret-Key Reconciliation by Public Discussion
  • Global, Unpredictable Bit Generation Without Broadcast

    Rump Session

  • On Schnorr's Preprocessing for Digital Signature Schemes
  • Cryptoanalysis of the Chang-Wu-Chen Key Distribution System
  • An Alternate Explanation of two BAN-logic "failures"
  • The Consequences of Trust in Shared Secret Schemes
  • Markov Ciphers and Alternating Groups
  • On Key Distribution and Authentication in Mobile Radio Networks

    [Top]

    Advances in Cryptology - CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings.

    Cryptosystems

  • Efficient Signature Schemes Based on Birational Permutations
  • A New Identification Scheme Based on Syndrome Decoding
  • The Shrinking Generator

    Stream Ciphers and Cryptographic Functions

  • An Integrity Check Value Algorithm for Stream Ciphers
  • Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract)

    Proof Systems and Zero-knowledge

  • A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
  • Secret Sharing and Perfect Zero Knowledge
  • On Message Proof Systems with Known Space Verifiers
  • Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract)

    Secret Sharing

  • Fully Dynamic Secret Sharing Schemes
  • Multisecret Threshold Schemes
  • Secret Sharing Made Short

    Number Theory and Algorithms

  • A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
  • An Implementation of the General Number Field Sieve
  • On the Factorization of RSA-120
  • Comparison of Three Modular Reduction Functions

    Differential Cryptoanalysis

  • Differtial Cryptanalysis of Lucifer
  • Differential Attack on Message Authentication Codes
  • Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds
  • Weak Keys for IDEA

    Complexity Theory

  • Entity Authentication and Key Distribution
  • On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
  • Joint Encryption and Message-Efficient Secure Computation
  • Cryptographic Primitives Based on Hard Learning Problems

    Applications

  • Extensions of Single-term Coins
  • Untraceable Off-line Cash in Wallets with Observers (Extended Abstract)
  • Discreet Solitary Games

    Authentication Codes

  • On Families of Hash Functions via Geometric Codes and Concatenation
  • On the Construction of Perfect Authentication Codes that Permit Arbitration
  • Codes for Interactive Authentication

    Hash Functions

  • Hash Functions Based on Block Ciphers: A Synthetic Approach
  • Security of Iterated Hash Functions Based on Block Ciphers

    Cryptoanalysis

  • Improved Algorithms for the Permuted Kernel Problem
  • On the Distribution of Characteristics in Composite Permutations
  • Remark on the Threshold RSA Signature Scheme
  • Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
  • Attacks on the Birational Permutation Signature Schemes

    Key Distribution

  • Interaction in Key Distribution Schemes (Extended Abstract)
  • Secret-Key Agreement without Public-Key Cryptography
  • Broadcast Encryption

    [Top]

    Fast Software Encryption, Cambridge Security Workshop, Cambridge, UK, December 9-11, 1993, Proceedings.

    Block Ciphers I

    Stream Ciphers

    Software Performance

    Cryptanalysis

    Hash Functions and Hybrid Ciphers

    Randomness and Nonlinearity

    Block Ciphers II

    [Top]

    Error Control, Cryptology, and Speech Compression - Workshop on Information Protection, Moscow, Russia, December 6-9, 1993, Selected Papers.

    Cryptology

    Error Control Coding

    Speech Compression

    [Top]

    Advances in Cryptology - CRYPTO '94, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1994, Proceedings.

    Block Ciphers

  • The First Experimental Cryptanalysis of the Data Encryption Standard
  • Linear Cryptanalysis of the Fast Data Encipherment Algorithm
  • Differential-Linear Cryptanalysis
  • Linear Cryptanalysis Using Multiple Approximations

    Schemes Based on New Problems

  • Hashing with SL_2
  • Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
  • Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders

    Signatures I

  • Designated Confirmer Signatures and Public-Key Encryption are Equivalent
  • Directed Acyclic Graphs, One-way Functions and Digital Signatures
  • An Identity-Based Signature Scheme with Bounded Life-Span

    Implementation and Hardware Aspects

  • More Flexible Exponentiation with Precomputation
  • A Parallel Permutation Multiplier for a PGM Crypto-chip
  • Cryptographic Randomness from Air Turbulence in Disk Drives

    Authentication and Secret Sharing

  • Cryptanalysis of the Gemmell and Naor Multiround Authentication Protocol
  • LFSR-based Hashing and Authentication
  • New Bound on Authentication Code with Arbitration
  • Multi-Secret Sharing Schemes

    Zero Knowledge

  • Designing Identification Schemes with Keys of Short Size
  • Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
  • Language Dependent Secure Bit Commitment
  • On the Length of Cryptographic Hash-Values Used in Identification Schemes

    Sigantures II

  • Incremental Cryptography: The Case of Hashing and Signing
  • An Efficient Existentially Unforgeable Signature Scheme and its Applications

    Combinatorics and its Applications

  • Bounds for Resilient Functions and Orthogonal Arrays
  • Tracing Traitors

    Number Theory

  • Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
  • Fast Generation of Provable Primes Using Search in Arithmetic Progressions

    Cryptoanaysis and Protocol Failures

  • Attack on the Cryptographic Scheme NIKS-TAS
  • On the Risk of Opening Distributed Keys
  • Cryptanalysis of Cryptosystems Based on Remote Chaos Replication

    Pseudo-Random Generation

  • A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences

    Block Ciphers

  • The Security of Cipher Block Chaining
  • A Chosen Plaintext Attack of the 16-round Khufu Cryptosystem
  • Ciphertext Only Attack for One-way Function of the MAP Using One Ciphertext
  • Pitfalls in Designing Substitution Boxes (Extended Abstract)

    Secure Computations and Protocols

  • A Randomnesss-Rounds Tradeoff in Private Computation
  • Secure Voting Using Partially Compatible Homomorphisms
  • Maintaining Security in the Presence of Transient Faults

    [Top]

    Computer Security - ESORICS 94, Third European Symposium on Research in Computer Security, Brighton, UK, November 7-9, 1994, Proceedings.

    Measures

    High Assurance Software

    Key Management 1

    Authentication

    Key Management 2

    Digital Payment

    Distributed Systems

    Access Controls

    Database 1

    Database 2

    [Top]

    Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28 - December 1, 1994, Proceedings.

    Invited Lecture I

    Secret Sharing

    Stream Ciphers

    Cryptographic Functions

    Invited Lecture II

    Protocols

    Invited Lectures III

    Authentication and Digital Signatures

    Chryptanalysis

    Hash Functions

    Key Distribution

    Public Key Cryptography

    Block Cipher Algorithms

    Rump Session

    [Top]

    Advances in Cryptology - EUROCRYPT '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, Proceeding.

    Cryptoanalysis

  • Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
  • Convergence in Differential Distributions
  • A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma

    Signatures

  • On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity
  • Verifiable Secret Sharing
  • Server (Prover/Signer)-Aided Verification of Identity Proofs and Signatures

    Number Theory

  • Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance
  • An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
  • A Block Lanczos Algorithm for Finding Dependencies Over GF(2)

    Protocol Aspects

  • How to Break Another Provably Secure Payment System
  • Quantum Oblivious Mutual Identification
  • Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract)
  • Secure Multiround Authentication Protocols

    Secret Sharing

  • Verifiable Secret Sharing as Secure Computation
  • Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract)
  • General Short Computational Secret Sharing Schemes

    Electronic Cash

  • Fair Blind Signatures
  • Ripping Coins For a Fair Exchange
  • Restrictive Blinding of Secret-Key Certificates

    Shift Registers and Boolean Function

  • Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers
  • Large Periods Nearly de Bruijn FCSR Sequences
  • On Nonlinear Resilient Functions (Extended Abstract)

    Authentication Codes

  • Combinatorial Bounds for Authentication Codes with Arbitration
  • New Hash Functions For Message Authentication
  • A² Codes from Universal Hash Classes

    New Schemas

  • A New Identification Scheme Based on the Perceptrons Problem
  • Fast RSA-type Schemes Based on Singular Cubic Curves y²+axy=m³(mod n)

    Complexity Aspects

  • Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems
  • Universal Hash Functions & Hard Core Bits
  • Recycling Random Bits in Composed Perfect Zero-Knowledge

    Implementation Aspects

  • On the Matsumoto and Imai's Human Identification Scheme
  • Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth
  • Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit Microcontrollers

    Rump Session

  • Anonymous NIZK Proofs of Knowledge with Preprocessing

    [Top]

    Advances in Cryptology - EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, Perugia, Italy, May 9-12, 1994, Proceedings.

    Secret Sharing

  • Visual Cryptography
  • The Size of a Share Must Be Large
  • A Linear Construction of Perfect Secret Sharing Schemes
  • On the Dealer's Randomness Required in Secret Sharing Schemes

    Hash Functions

  • Black Box Cryptoanalysis of Hash Networks Based on Multipermutations
  • A Practical Attack against Knapsack based Hash Functions (Extended Abstract)

    Signatures I

  • The Blinding of Weak Signatures (Extended Abstract)
  • Can D.S.A. be Improved? Complexity Trade-Offs with the Digital Signature Standard
  • Designated Confirmer Signatures

    Cryptosystems

  • Optimal Asymmetric Encryption
  • A Multiple-Iterated Trapdoor for Dense Compact Knapsacks
  • On the Security of Some Cryptosystems Based on Error-correcting Codes

    Zero-Knowledge and Protocol Methodology

  • Parallel Divertibility of Proofs of Knowledge (Extended Abstract)
  • Methodology for Digital Money based on General Cryptographic Tools

    Signatures II

  • New Group Signature Schemes (Extended Abstract)
  • Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
  • Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders

    Pseudorandom Generators

  • The Self-Shrinking Generator
  • Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract)
  • General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences
  • Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers

    Authehntication Codes

  • Near Optimal Unconditionally Secure Authentication
  • Authentication Codes in Plaintext and Chosen-content Attacks

    Key Agreement and Key Distribution

  • Linking Information Reconciliation and Privacy Amplification (Extended Abstract)
  • A Secure and Efficient Conference Key Distribution System (Extended Abstract)
  • Space Requirements for Broadcast Encryption
  • How to Break and Repair Leighton and Micali's Key Agreement Protocol

    Protocols

  • Single-Term Divisible Electronic Coins
  • Formal Requirements for Key Distribution Protocols
  • Breaking Efficient Anonymous Channel

    Cryptoanalysis and Block Ciphers

  • On Matsui's Linear Cryptanalysis
  • Links Between Differential and Linear Cryptoanalysis
  • On Correlation Between the Order of S-boxes and the Strength of DES
  • Relationships Among Nonlinear Criteria (Extended Abstract)

    Number Theory and Algorithms

  • Efficient Exponentiation using Procomputation and Vector Addition Chains
  • MIMD-Factorisation on Hypercubes

    Rump Session

  • New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel-DM
  • New Potentially 'Weak' Keys for DES and LOKI (Extended Abstract)
  • Blackmailing using Undeniable Signatures
  • Blind Signatures Based on the Discrete Logarithm Problem
  • Comments on Soviet Encryption Algorithm
  • Linear Approximation of Block Ciphers
  • Memory Efficient Variants of Public-Key Schemes for Smart Card Applications
  • A Systematic Attack on Clock Controlled Cascades
  • On A²-Codes Including Arbiter's Attacks
  • An Improvement of Davies' Attack on DES
  • Q-Deformed Quantum Cryptography

    [Top]

    Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings.

    MAC and Hash

  • MDx-MAC and Building Fast MACs from Hash Functions
  • XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
  • Bucket Hashing and its Application to Fast Message Authentication

    Number Theory I

  • Fast Key Exchange with Elliptic Curve Systems
  • Fast Server-Aided RSA Signatures Secure Against Active Attacks
  • Security and Performance of Server-Aided RSA Computation Protocols

    Oblivious Transfer

  • Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
  • Precomputing Oblivious Transfer
  • Committed Oblivious Transfer and Private Multi-Party Computation
  • On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols

    Cryptoanalysis I

  • How to Break Shamir's Asymmetric Basis
  • On the Security of the Gollmann Cascades
  • Improving the Search Algorithm for the Best Linear Expression
  • On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm

    Key Escrow

  • A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems
  • A Key Escrow System with Warrant Bounds
  • Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract)
  • Escrow Encryption Systems Visited: Attacks, Analysis and Designs

    Protocols

  • Robustness Principles for Public Key Protocols

    Cryptoanalysis II

  • Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88
  • Cryptoanalysis Based on 2-Adic Rational Approximation
  • A Key-schedule Weakness in SAFER K-64
  • Cryptoanalysis of the Immunized LL Public Key Systems

    Zero Knowledge

  • Escure Signature Schemes based on Interactive Protocols
  • Improved Efficient Arguments (Preliminary Version)
  • Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs

    Secret Sharing I

  • Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
  • Secret Sharing with Public Reconstruction (Extended Abstract)
  • General Perfect Secret Sharing Schemes

    Number Theory II

  • NFS with Four Large Primes: An Explosive Experiment
  • Some Remarks on Lucas-Based Cryptosystems

    Secret Sharing II

  • Threshold DSS Signatures without a Trusted Party
  • t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

    Everything Else

  • Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
  • An Efficient Divisible Electronic Cash Scheme
  • Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

    [Top]

    Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14-16 December 1994, Proceedings.

    [Top]

    Cryptography and Coding, 5th IMA Conference, Cirencester, UK, December 18-20, 1995, Proceedings.

    [Top]

    Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 3-5, 1995, Proceedings.

    Cryptographic Policy

    Key Escrow and Secret Sharing

    Block and Stream Ciphers

    Authentication Techniques

    Smart Cards and Cryptography

    Applications of Cryptography

    [Top]

    Electronic Commerce, Current Research Issues and Applications [Workshop at NIST, Gaithersburg, Maryland, USA, December 1, 1994].

    [Top]

    Fast Software Encryption, Third International Workshop, Cambridge, UK, February 21-23, 1996, Proceedings.

    Block Ciphers - Analysis

    Applications

    Hash Functions

    Block Ciphers - Proposals

    [Top]

    Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding.

    Cryptoanalysis I

  • Low-Exponent RSA with Related Messages
  • Generating EIGamal Signatures Without Knowing the Secret Key
  • On the Security of Two MAC Algorithms

    Public Key Cryptosystems

  • Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
  • A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
  • Public Key Encryption and Signature Schemes Based on Polynomials over Zn

    New Schemes and Protocols

  • Multi-Autority Secret-Ballot Elections with Linear Work
  • Asymmetric Fingerprinting (Extended Abstract)

    Multi-Party Computation

  • Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
  • Efficient Multiplicative Sharing Schemes
  • Equivocable Oblivious Transfer

    Proofs of Knowledge

  • Short Discrete Proofs
  • Designated Verifier Proofs and Their Applications

    Number Theory and Algorithms

  • Finding a Small Root of a Univariate Modular Equation
  • New Modular Multiplication Algorithms for Fast Modular Exponentiation
  • Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

    Secret Sharing

  • Publicly Verifiable Secret Sharing
  • Optimum Secret Sharing Scheme Secure against Cheating

    Cryptoanalysis II

  • The Security of the Gabidulin Public Key Cryptosystem
  • Non-Linear Approximations in Linear Cryptoanalysis
  • On the Difficulty of Software Key Escrow

    Pseudorandomness

  • An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
  • On the Existence of Secure Feedback Registers (Extended Abstract)

    Cryptographic Functions

  • Fast Low Order Approximation of Cryptographic Functions
  • Construction of t-Resilient Functions over a Finite Alphabet
  • Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions
  • Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel

    Key Management and Identification Schemes

  • Session Key Distribution Using Smart Cards
  • On Diffie-Hellman Key Agreement with Short Exponents
  • On the Security of a Practical Identification Scheme

    Digital Signature Schemes

  • Robust Threshold DSS Signatures
  • New Convertible Undeniable Signature Schemes
  • Security Proofs for Signature Schemes
  • The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin

    [Top]

    Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings.

    Hashing and Authentication I

  • Keying Hash Functions for Message Authentication
  • Universal Hashing and Multiple Authentication
  • Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings

    New Systems

  • Asymmetric Cryptography with a Hidden Monomial
  • Anonymous Communication and Anonymous Cash

    Cryptoanalysis I

  • Weakness in Some Threshold Cryptosystems
  • Hidden Collisions on DSS
  • The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone
  • Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems

    Hard Bits

  • All Bits ax+b mod p are Hard (Extended Abstract)
  • Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

    Signatures

  • Security of 2^t-Root Identification and Signatures
  • Robust and Efficient Sharing of RSA Functions
  • New Generation of Secure and Practical RSA-Based Signatures

    Zero Knowledge

  • Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
  • Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing

    Cryptoanalysis II

  • Improved Differential Attacks on RC5
  • Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude

    More on Symmetric Systems

  • Key-Schedule Cryptoanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
  • How to Protect DES Against Exhaustive Key Search

    Diffie-Hellman Oracle

  • Diffie-Hellman Oracles
  • Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)

    Hashing and Authentication II

  • Fast Hashing on the Pentium
  • On Fast and Provably Secure Message Authentication Based on Universal Hashing

    Quantum Crypto

  • Quantum Cryptography over Underground Optical Fibers
  • Quantum Key Distribution and String Oblivious Transfer in Noisy Channels

    Stream Ciphers

  • Linear Complexity of Periodic Sequences: A General Theory
  • Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations

    Secret Sharing

  • Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution
  • New Results on Visual Cryptography

    [Top]

    Computer Security - ESORICS 96, 4th European Symposium on Research in Computer Security, Rome, Italy, September 25-27, 1996, Proceedings.

    Session 1

    Session 2

    Session 3

    Session 4

    Panel

    Session 5

    Session 6

    Session 7

    Panel

    Session 8

    [Top]

    Advances in Cryptology - ASIACRYPT '96, International Conference on the Theory and Applications of Cryptology and Information Security, Kyongju, Korea, November 3-7, 1996, Proceedings.

    Discrete Log Based Systems

    Invited Talk 1

    Efficient Algorithms

    Hash Function and Block Ciphers

    Cryptographic Protocols

    Signature and Identification

    Invited Talk 2

    Visual Secret Sharing

    Key Distribution

    Boolean Functions

    Electronic Cash 1

    Electronic Cash 2

    Invited Talk 3

    Special Signatures

    Stream Ciphers

    Hard Problems

    [Top]

    Information Security and Privacy, First Australasian Conference, ACISP'96, Wollongong, NSW, Australia, June 24-26, 1996, Proceedings.

    Invited Lecture 1

    Session 1

    Session 2

    Session 3

    Invited Lecture 2

    Session 4

    Session 5

    Session 6

    Invited Lecture 3

    Session 7

    Session 8

    Session 9

    Session 10

    [Top]

    Concurrency and Parallelism, Programming, Networking, and Security: Second Asian Computing Science Conference, ASIAN '96, Singapore, December 2-5, 1996, Proceedings.

    Algorithms

    Constraints and Logic Programming

    Distributed Systems

    Formal Systems

    Networking and Security

    Programming and Systems

    Specification and Verification

    Posters

    Keynote Lecture

    Invited Lectures

    [Top]

    Security Protocols, International Workshop, Cambridge, United Kingdom, April 10-12, 1996, Proceedings.

    [Top]

    Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding.

    Block Ciphers

  • Two Attacks on Reduced IDEA
  • Combinatorial Properties of Basic Encryption Operations (Extended Abstract)

    Public Key Systems

  • A New Public-Key Cryptosystem
  • On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract)
  • Lattice Attacks on NTRU

    Protocols

  • Kleptography: Using Cryptography Against Cryptography
  • Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation
  • Anonymous Fingerprinting
  • A Secure and Optimally Efficient Multi-Authority Election Scheme

    Key Escrow

  • Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals
  • The GCHQ Protocol and Its Problems

    Hash-Functions

  • Bucket Hashing with a Small Key Size
  • A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost

    Information Theory

  • Smooth Entropy and Rényi Entropy
  • Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion

    Stream Ciphers

  • Linear Statistical Weakness of Alleged RC4 Keystream Generator
  • Cryptanalysis of Alleged A5 Stream Cipher

    Complexity Theory

  • Lower Bounds for Discrete Logarithms and Related Problems
  • Stronger Security Proofs for RSA and Rabin Bits
  • Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function
  • Efficient Cryptographic Protocols Based on Noisy Channels
  • Rapid Demonstration of Linear Relations Connected by Boolean Operators
  • Oblivious Transfers and Privacy Amplification

    Implementation

  • SHA: A Design for Parallel Architectures
  • Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
  • Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n

    Authentication

  • Incremental Cryptography and Memory Checkers
  • Almost k-wise Independent Sample Spaces and Their Cryptologic Applications

    Boolean Functions

  • More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings
  • Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria

    Signatures

  • Distributed "Magic Ink" Signatures
  • Efficient and Generalized Group Signatures
  • Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees
  • Selective Forgery of RSA Signatures Using Redundancy

    [Top]

    Fast Software Encryption, 4th International Workshop, FSE '97, Haifa, Israel, January 20-22, 1997, Proceedings.

    Cryptanalysis I

  • x2 Cryptanalysis of the SEAL Encryption Algorithm
  • Partitioning Cryptanalysis
  • The Interpolation Attack on Block Ciphers
  • Best Differential Characteristic Search of FEAL

    Blockciphers I

  • New Block Encryption Algorithm MISTY
  • The Design of the ICE Encryption Algorithm

    Discussion

    Stream Ciphers

  • TWOPRIME: A Fast Stream Ciphering Algorithm
  • On Nonlinear Filter Generators
  • Chameleon - A New Kind of Stream Cipher

    Cryptanalysis II

  • Improving Linear Cryptanalysis of LOKI91 by Probabilistic Counting Method
  • Cryptanalysis of Ladder-DES
  • A Family of Trapdoor Ciphers

    Blockciphers II

  • The Block Cipher Square
  • XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications

    Message Authentication Codes

  • MMH: Software Message Authentication in the Gbit/Second Rates
  • Fast Message Authentication Using Efficient Polynomial Evaluation
  • Reinventing the Travois: Encryption/MAC in 30 ROM Bytes

    Modes of Operation

  • All-or-Nothing Encryption and the Package Transform
  • On the Security of Remotely Keyed Encryption
  • Sliding Encryption: A Cryptographic Tool for Mobile Agents

    Fast Software Encryption

  • Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
  • A Fast New DES Implementation in Software
  • Optimizing a Fast Stream Cipher for VLIW, SIMD, and Superscalar Processors

    [Top]

    Information Security and Privacy, Second Australasian Conference, ACISP'97, Syndey, NSW, Australia, July 7-9, 1997, Proceedings.

    Keynote Lecture

    1. Security Models And Access Control

    2. Network Security

    3. Secure Hardware And Implementation Issues

    4. Cryptographic Functions And Ciphers

    5. Authentication Codes And Secret Sharing Schemes

    6. Cryptanalysis

    7. Key Escrow

    8. Security Protocols And Key Management

    9. Applications

    [Top]

    Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings.

    Complexity Theory

  • The Complexity of Computing Hard Core Predicates
  • Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
  • Keeping the SZK-Verifier Honest Unconditionally

    Invited Lecture

  • On the Foundations of Modern Cryptography

    Cryptographic Primitives

  • Plug and Play Encryption
  • Deniable Encryption

    Lattice-Based Cryptography

  • Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
  • Public-Key Cryptosystems from Lattice Reduction Problems

    Digital Signatures

  • RSA-Based Undeniable Signatures
  • Security of Blind Digital Signatures (Extended Abstract)
  • Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption)
  • How to Sign Digital Streams

    Cryptoanalysis of Public-Key Cryptosystems (I)

  • Merkle-Hellman Revisited: A Cryptoanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
  • Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack
  • A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy

    Cryptoanalysis of Public-Key Cryptosystems (II)

  • On the Security of the KMOV Public Key Cryptosystem
  • A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp
  • The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems
  • "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case

    Information Theory

  • Unconditional Security Against Memory-Bounded Adversaries
  • Privacy Amplification Secure Against Active Adversaries
  • Visual Authentication and Identification

    Invited Lecture

  • Quantum Information Processing: The Good, the Bad and the Ugly

    Elliptic Curve Implementation

  • Efficient Algorithms for Elliptic Curve Cryptosystems
  • An Improved Algorithm for Arithmetic on a Family of Elliptic Curves

    Number-Theoretic Systems

  • Fast RSA-Type Cryptosystems Using N-Adic Expansion
  • A One Way Function Based on Ideal Arithmetic in Number Fields

    Distributed Cryptography

  • Efficient Anonymous Multicast and Reception (Extended Abstract)
  • Efficient Group Signature Schemes for Large Groups (Extended Abstract)
  • Efficient Generation of Shared RSA Keys (Extended Abstract)
  • Proactive RSA

    Hash Functions

  • Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
  • Collision-Resistant Hashing: Towards Making UOWHFs Practical
  • Fast and Secure Hashing Based on Codes

    Cryptoanalysis of Secret-Key Cryptosystems

  • Edit Distance Correlation Attack on the Alternating Step Generator
  • Differential Fault Analysis of Secret Key Cryptosystems
  • Cryptoanalysis of the Cellular Encryption Algorithm

    [Top]

    Financial Cryptography, First International Conference, FC '97, Anguilla, British West Indies, February 24-28, 1997, Proceedings.

    [Top]

    Information and Communication Security, First International Conference, ICICS'97, Beijing, China, November 11-14, 1997, Proceedings.

    Session 1

    Session 2

    Session 3

    Session 4

    Session 5

    Session 6

    Session 7

    Session 8

    Session 9

    Session 10

    Session 11

    Session 12

    Session 13

    Session 14

    Session 15

    Session 16

    [Top]

    Cryptography and Coding, 6th IMA International Conference, Cirencester, UK, December 17-19, 1997, Proceedings.

    [Top]

    Security Protocols, 5th International Workshop, Paris, France, April 7-9, 1997, Proceedings.

    [Top]

    Fast Software Encryption, 5th International Workshop, FSE '98, Paris, France, March 23-25, 1998, Proceedings.

    Cryptanalysis I

  • New Results in Linear Cryptanalysis of RC5
  • Higher Order Differential Attak of CAST Cipher
  • Cryptanalysis of TWOPRIME

    New Stream Ciphers

  • JEROBOAM
  • Fast Hashing and Stream Encryption with PANAMA
  • Joint Hardware / Software Design of a Fast Stream Cipher

    Design Construction Analysis

  • On the Security of the Hashing Scheme Based on SL2
  • About Feistel Schemes with Six (or More) Rounds
  • Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs

    Hash Functions

  • MRD Hashing
  • New Constructions for Secure Hash Functions

    Pseudo-Random Generators

  • Cryptanalytic Attacks on Pseudorandom Number Generators

    New Block Ciphers

  • CS-Cipher
  • On the Design and Security of RC2
  • Serpent: A New Block Cipher Proposal

    Modes of Operations

  • Attacking Triple Encryption
  • Cryptanalysis of Some Recently-Proposed Multiple Modes of Operation

    Cryptanalysis II

  • Differential Cryptanalysis of the ICE Encryption Algorithm
  • The First Two Rounds of MD4 are Not One-Way
  • Differential Cryptanalysis of KHF

    [Top]

    Information Security, First International Workshop, ISW '97, Tatsunokuchi, Japan, September 17-19, 1997, Proceedings.

    Special Lecture

    Cryptanalysis

    Invited Lecture

    Public-Key Cryptography

    Special Lecture

    Key Management

    Invited Lecture

    Implementation (Hard/Soft)

    Invited Lecture

    Security Management

    Signature/Authentication

    Invited Lecture

    Payment Scheme

    Key Sharing

    [Top]

    Trends in Distributed Systems for Electronic Commerce, International IFIP/GI Working Conference, TREC'98, Hamburg, Germany, June 3-5, 1998, Proceedings.

    Business over the Internet

    A Framework for the Optimizing of WWW Advertising
    Symmetric Adaptive Customer Modeling for Electronic Commerce in a Distributed Environment
    Maximizing Seller's Profit for Electronic Commerce

    Security and Payment

    Approaches of Digital Signature Legislation
    A Java-Based Distributed Platform for Multilateral Security
    BARTER: A Backbone Architecture for Trade of Electronic Content
    An Agent-Based Secure Internet Payment System for Mobile Computing
    A Payment Scheme for Mixes Providing Anonymity

    Middleware and Brokerage

    Satisfying Requirements for Electronic Commerce
    Distributed Models for Brokerage on Electronic Commerce
    Distributed Print on Demand Systems in the Xpect Framework
    OFFER: A Broker-Centered Object Framework For Electronic Requisitioning

    Interorganisational Workflow Management

    Workflow Modeling for Internet-Based Commerce: An Approach Based on High-Level Petri Nets
    Market-Based Workflow Management
    Distributed, Interoperable Workflow Support for Electronic Commerce

    Agents

    Security Requirements for Mobile Agents in Electronic Markets
    A Secure Intelligent Trade Agent System
    Migrating Objects in Electronic Commerce Applications
    Providing Reliable Agents for Electronic Commerce

    [Top]

    Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31 - June 4, 1998, Proceeding.

    Distributed Cryptography and Applications I

  • Securing Threshold Cryptosystems against Chosen Ciphertext Attack
  • Auto-Recoverable Auto-Certifiable Cryptosystems
  • A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications

    Complexity Theory

  • Equivalence of Counting the Number of Points on Elliptic Curve over the Ring Zn and Factoring n
  • Breaking RSA May Not Be Equivalent to Factoring
  • Lower Bounds on Generic Algorithms in Groups

    Cryptanalysis of Block Ciphers

  • Improved Cryptanalysis of RC5
  • Cryptanalysis of the ANSI X9.52 CBCM Mode
  • Differential-Linear Weak Key Classes of IDEA

    Distributed Cryptography and Applications II

  • Divertible Protocols and Atomic Proxy Cryptography
  • Optimum Traitor Tracing and Asymmetric Schemes

    Computational Algorithms

  • On Finding Small Solutions of Modular Multivariate Polynomial Equations
  • Computing Discrete Logarithms with Quadratic Number Rings
  • Improved Algorithms for Isomorphisms of Polynomials

    Improving Computational Efficiency

  • Visual Cryptanalysis
  • How to Improve an Exponentiation Black-Box
  • Speeding up Discrete Log and Factoring Based Schemes via Precomputations
  • Fast Batch Verification for Modular Exponentiation and Digital Signatures

    Paradigms for Symmetric Systems

  • A Formal Treatment of Remotely Keyed Encryption
  • Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible
  • The Chain & Sum Primitive and Its Applications to MACs and Stream Ciphers

    Public Key Cryptosystems

  • A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
  • A New Public-Key Cryptosystem as Secure as Factoring

    Complexity Theory

  • Towards a Better Understanding of One-Wayness: Facing Linear Permutations
  • Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions

    Multi-Party Computation

  • Secure Communications in Minimal Connectivity Models
  • On the Foundations of Oblivious Transfer
  • Quorum-Based Secure Multi-party Computation

    Digital Signatures

  • Strengthened Security for Blind Signatures
  • Generic Constructions for Secure and Efficient Confirmer Signature Schemes
  • Security Analysis of a Practical "on the fly" Authentication and Signature Generation

    Untraceability in Multi-party Schemes

  • Universally Verifiable Mix-net with Verification Work Indendent of the Number of Mix-servers
  • A Practical Mix

    Boolean Functions

  • On the Propagation Criterion of Degree l and Order k
  • Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity
  • Heuristic Design of Cryptographically Strong Balanced Boolean Functions

    Combinatorial Design and Analysis of Distributed Schemes

  • Secret Sharing Schemes with Bipartite Access Structure
  • Combinatorial Bounds for Broadcast Encryption
  • New Results on Multi-Receiver Authentication Codes

    Cryptoanalysis of Elliptic Curve Systems

  • Specialized Integer Factorization
  • Security of an Identity-Based Cryptosystem and the Related Reductions

    Electronic Commerce and Payment

  • Easy Come - Easy Go Divisible Cash
  • Secure and Efficient Metering
  • Optimistic Fair Exchange of Digital Signatures (Extended Abstract)

    [Top]

    Mobile Agents and Security.

    Foundations

  • Security Issues in Mobile Code Systems
  • Environmental Key Generation Towards Clueless Agents
  • Language Issues in Mobile Program Security
  • Protecting Mobile Agents Against Malicious Hosts

    Security Mechanisms

  • Safe, Untrusted Agents Using Proof-Carrying Code
  • Time Limited Blackbox Security: Protecting Mobile Agents From Malicious Hosts
  • Authentication for Mobile Agents
  • Cryptographic Traces for Mobile Agents

    Mobile Code Systems

  • D'Agents: Security in a Multiple-Language, Mobile-Agent System
  • A Security Model for Aglets
  • Signing, Sealing, and Guarding Java Objects

    Active Content and Security

  • The Safe-Tcl Security Model
  • Web Browsers and Security

    [Top]

    Public Key Cryptography, First International Workshop on Practice and Theory in Public Key Cryptography, PKC '98, Pacifico Yokohama, Japan, February 5-6, 1998, Proceedings.

    Invited Talks

  • Distributed Public Key Cryptosystems
  • How (not) to Design RSA Signature Schemes
  • Overview of Elliptic Curve Cryptography

    Special Talk

  • Lattices and Cryptography: An Overview

    Regular Contributions

  • A Signcryption Scheme with Signature Directly Verifiable by Public Key
  • Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders
  • Lower Bounds on Term-Based Divisible Cash Systems
  • Certifying Trust
  • On the Security of Server-Aided RSA Protocols
  • On the Security of ElGamal Based Encryption
  • An Authenticated Diffie-Hellman Key Agreement Protocol Secure Against Active Attacks
  • On the Security of Girault`s Identification Scheme
  • A Scheme for Obtaining a Message from the Digital Multisignature
  • Secure Hyperelliptic Cryptosystems and Their Performances
  • A Practical Implementation of Elliptic Curve Cryptosystems over GF(p) on a 16-bit Microcomputer
  • Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
  • Public-Key Cryptosystems Using the Modular Group
  • A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
  • A New Hash Function Based on MDx-Family and Its Application to MAC

    Recent Results

  • Security Issues for Contactless Smart Cards
  • Parameters for Secure Elliptic Curve Cryptosystem - Improvements on Schoof's Algorithm
  • A Note on the Complexity of Breaking Okamoto-Tanaka ID-Based Key Exchange Scheme

    [Top]

    Cooperative Information Agents II, Learning, Mobility and Electronic Commerce for Information Discovery on the Internet, Second International Workshop, CIA' 98, Paris, France, July 4-7, 1998, Proceedings.

    Cooperative Information Agents - Systems and Applications

    What Can Agents Do in Industry, and Why? An Overview of Industrially-Oriented R&D at CEC
    The InfoSleuth Agent System
    Agents for Hypermedia Information Discovery
    Trafficopter: A Distributed Collection System for Traffic Information
    Agent-Supported Information Retrieval for Tracking and Tracing
    The Dynamics of the UMDL Service Market Society

    Cooperative Information Agents - Issues of Design, Querying and Communication

    Multiagent Systems in Information-Rich Environments
    Strategies for Querying Information Agents
    Grand Challenge Problems on Cross Cultural Communication: Toward Socially Intelligent Agents

    Rational Collaboration and Electronic Commerce

    Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation
    Cooperative vs. Competitive Multi-Agent Negotiations in Retail Electronic Commerce
    Enhancing Mobile Agents with Electronic Commerce Capabilities
    Dynamics of an Information-Filtering Economy

    Adaptive and Collaborative Information Gathering

    Levels of Adaptation in Systems of Coordinating Information Agents
    Adaptive Choice of Information Sources (Extended Abstract)
    Agent Mediated Collaborative Web Page Filtering
    Content-based Collaborative Information Filtering: Actively Learning to Classify and Recommend Documents
    Domain Experts for Information Retrieval in the World Wide Web
    Semantic Navigation Maps for Information Agents

    Mobile Information Agents in the Internet

    Coordinating Patterns of Mobile Information Agents
    Mobile Information Agents on the Web
    Melding Abstractions with Mobile Agents
    Data-Security in Heterogeneous Agent Systems

    [Top]

    Information Security and Privacy, Third Australasian Conference, ACISP'98, Brisbane, Queensland, Australia, July 1998, Proceedings.

    Invited Speakers

  • A Review of the SESAME Development
  • The Security of Public Key Cryptosystems Based on Integer Factorization

    Network Security I

  • A Uniform Approach to Securing Unix Applications Using SESAME
  • Integrated Management of Network and Host Based Security Mechanisms
  • Covert Distributed Computing Using Java Through Web Spoofing

    Block Ciphers

  • Differential Cryptanalysis of a Block Cipher
  • On Private-Key Cryptosystems Based on Product Codes
  • Key Schedules of Iterative Block Ciphers

    Network Security II

  • Low-Cost Secure Server Connection with Limited-Privilege Clients
  • A Solution to Open Standard of PKI
  • Comparison of Commitment Schemes Used in Mix-Mediated Anonymous Communication for Preventing Pool-Mode Attacks

    Stream Ciphers

  • Correlation Attacks on Up/Down Cascades
  • A Stream Cipher Based on Linear Feedback over GF(28)
  • A Probabilistic Correlation Attack on the Shrinking Generator

    Authorization Codes and Boolean Functions

  • Bounds and Constructions for A3-code with Multi-senders
  • Rotation-Symmetric Functions and Fast Hashing
  • How to Improve the Nonlinearity of Bijective S-Boxes

    Software Security and Electronic Commerce

  • Object Modeling of Cryptographic Algorithms with UML
  • Adapting an Electronic Purse for Internet Payments
  • LITESET: A Light-Weight Secure Electronic Transaction Protocol

    Public Key Cryptography

  • Applications of Linearised and Sub-linearised Polynomials to Information Security
  • Protocol Failures Related to Order of Encryption and Signature

    Hardware

  • Protection Against EEPROM Modification Attacks
  • Trends in Quantum Cryptography in Czech Republic

    Access Control

  • A High Level Language for Conventional Access Control Models
  • Fast Access Control Decisions from Delegation Certificate Databases
  • Meta Objects for Access Control: Role-Based Principals
  • A Dynamically Typed Access Control Model

    Protocols

  • Efficient Identity-Based Conference Key Distribution Protocols
  • A Formal Model for Systematic Design of Key Establishment Protocols
  • Key Establishment Protocols for Secure Mobile Communications: A Selective Survey
  • Detecting Key-Dependencies

    Secret Sharing

  • Secret Sharing in Multilevel and Compartmented Groups
  • On Construction of Cumulative Secret Sharing Schemes
  • A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group

    Digital Signatures

  • A User Identification System Using Signature Written with Mouse
  • On Zhang's Nonrepudiable Proxy Signature Schemes

    [Top]

    Advances in Cryptology 1981 - 1997

    Table of Contents

    University of California, Santa Barbara, Santa Barbara, California, USA, 1982

    LNCS 0149, Springer-Verlag Berlin Heidelberg 1983

    Plenum Publishing, New York, USA, 1982

    Plenum Publishing, New York, USA, 1984

    LNCS 0209, Springer-Verlag Berlin Heidelberg 1985

    LNCS 0196, Springer-Verlag Berlin Heidelberg 1985

    LNCS 0219, Springer-Verlag Berlin Heidelberg 1986

    LNCS 0218, Springer-Verlag Berlin Heidelberg 1986

    Department of Electrical Engineering, University of Linköping, Linkoping, Sweden, 1986

    LNCS 0263, Springer-Verlag Berlin Heidelberg 1986

    LNCS 0304, Springer-Verlag Berlin Heidelberg 1988

    LNCS 0293, Springer-Verlag Berlin Heidelberg 1987

    LNCS 0330, Springer-Verlag Berlin Heidelberg 1988

    LNCS 0403, Springer-Verlag Berlin Heidelberg 1989

    LNCS 0434, Springer-Verlag Berlin Heidelberg 1989

    LNCS 0435, Springer-Verlag Berlin Heidelberg 1989

    LNCS 0473, Springer-Verlag Berlin Heidelberg 1991

    LNCS 0537, Springer-Verlag Berlin Heidelberg 1990

    LNCS 0547, Springer-Verlag Berlin Heidelberg 1991

    LNCS 0576, Springer-Verlag Berlin Heidelberg 1992

    LNCS 0658, Springer-Verlag Berlin Heidelberg 1993

    LNCS 0740, Springer-Verlag Berlin Heidelberg 1993

    LNCS 0765, Springer-Verlag Berlin Heidelberg 1994

    LNCS 0773, Springer-Verlag Berlin Heidelberg 1994

    LNCS 0950, Springer-Verlag Berlin Heidelberg 1995

    LNCS 0839, Springer-Verlag Berlin Heidelberg 1994

    LNCS 0921, Springer-Verlag Berlin Heidelberg 1995

    LNCS 0963, Springer-Verlag Berlin Heidelberg 1995

    LNCS 1070, Springer-Verlag Berlin Heidelberg 1996

    LNCS 1109, Springer-Verlag Berlin Heidelberg 1996

    LNCS 1233, Springer-Verlag Berlin Heidelberg 1997

    LNCS 1294, Springer-Verlag Berlin Heidelberg 1997

    [Top]

    [Top]

    Financial Cryptography, Second International Conference, FC'98, Anguilla, British West Indies, February 23-25, 1998, Proceedings.

  • Micropayments via Efficient Coin-Flipping
  • X-Cash: Executable Digital Cash
  • Distributed Trustees and Revocability: A Framework for Internet Payment
  • A Platform for Privately Defined Currencies, Loyalty Credits, and Play Money
  • Assessment of Threats for Smart Card Based Electronic Cash
  • Using a High-Performance, Programmable Secure Coprocessor
  • Secure Group Barter: Multi-party Fair Exchange with Semi-Trusted Neutral Parties
  • A Payment Scheme Using Vouchers
  • A Formal Specification of Requirements for Payment Transactions in the SET Protocol
  • On Assurance Structures for WWW Commerce
  • Certificate Recocation: Mechanics and Meaning
  • Revocation: Options and Challenges
  • On Certificate Revocation and Validation
  • Can We Eliminate Certificate Revocations Lists
  • Group Blind Digital Signatures: A Scalable Solution to Electronic Cash
  • Curbing Junk E-Mail via Secure Classification
  • Publicly Verifiable Lotteries: Applications of Delaying Functions
  • Robustness and Security of Digital Watermarks
  • Beyond Identity: Warranty-Based Digital Signature Transactions
  • Compliance Checking in the PolicyMaker Trust Management System
  • An Efficient Fair Off-Line Electronic Cash System with Extensions to Checks and Wallets with Observers
  • A More Efficient Untraceable E-Cash System with Partially Blind Signatures Based on the Discrete Logarithm Problem
  • Cryptanalysis of SPEED

    [Top]

    Computer Security - ESORICS 98, 5th European Symposium on Research in Computer Security, Louvain-la-Neuve, Belgium, September 16-18, 1998, Proceedings.

    [Top]

    Advances in Cryptology - ASIACRYPT '98, International Conference on the Theory and Applications of Cryptology and Information Security, Beijing, China, October 18-22, 1998, Proceedings.

    Public Key Cryptosystems

  • Generating RSA Moduli with a Predetermined Portion
  • Generation of Shared RSA Keys by Two Parties
  • An Attack on RSA Given a Small Fraction of the Private Key Bits
  • C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai

    Invited Talk

  • ECC/DLP and Fractoring-Based Cryptography: A Tale of Two Families (Abstract)

    Elliptic Curve Cryptosystems

  • Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
  • Efficient Implementation of Schoof's Algorithm
  • Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2n
  • Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings
  • Elliptic Curve Discrete Logarithms and the Index Calculus

    Cryptanalysis 1

  • Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers
  • Improved Truncated Differential Attacks on SAFER
  • Optimal Resistance Against the Davies and Murphy Attack

    Signature

  • A Group Signature Scheme with Improved Efficiency
  • A Study on the Proposed Korean Digital Signature Algorithm

    Cryptanalysis 2

  • Cryptoanalysis of the Original McEliece Cryptosystem
  • Improving the Security of the McEliece Public-Key Cryptosystem
  • Cryptoanalysis in Prime Order Subgroups of Z*n

    Finite Automata

  • Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC

    Authentication Codes

  • Bounds and Constructions for Multireceiver Authentication Codes

    Electronic Cash

  • Fair Off-Line e-cash Made Easy
  • Off-Line Fair Payment Protocols Using Convertible Signatures
  • Efficient Fair Exchange with Verifiable Confirmation of Signatures
  • Adaptively Secure Oblivious Transfer

    Steam Ciphers

  • ML-Sequences over Rings Z/(2e)*: I. Constructions of Nondegenerative ML-Sequences II. Injectiveness of Compression Mappings of New Classes
  • Analysis Methods for (Alleged) RCA
  • Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators

    Cryptographic Protocols

  • A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
  • The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure

    Key Escrow

  • Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically)

    New Cryptography

  • Audio and Optical Cryptography

    Information Theory

  • Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement
  • Some Bounds and a Construction for Secure Broadcast Encryption

    [Top]

    Computer Safety, Reliability and Security, 17th International Conference, SAFECOMP'98, Heidelberg, Germany, October 5-7, 1998, Proceedings.

    Formal Methods I - Analysis and Specification

  • CoRSA - A Constraint Based Approach to Requirements and Safety Analysis
  • An Agenda for Specifying Software Components with Complex Data Models
  • Safety in Production Cell Components: An Appraoch Combining Formal Real-Time Specifications and Patterns
  • Safety Properties Ensured by the OASIS Model for Safety Critical Real-Time Systems
  • Linking Hazard Analysis to Formal Specification and Design in B

    Management and Human Factors

  • Controlling your Design through your Software Process
  • Operator Errors and Their Causes

    Security

  • A Performance Comparison of Group Security Mechanisms
  • Towards Secure Downloadable Executable Content: The Java Paradigm
  • Model and Implementation of a Secure SW-Development Process for Mission Critical Software
  • Impact of Object-Oriented Software Engineering Applied to the Development of Security Systems

    Medical Informatics

  • ``Profit by Safety'' or Quackery in Biomedical Information Technology

    Formal Methods II - Languages and Verification

  • Towards Automated Proof of Fail-Safe Behaviour
  • Verifying a Time-Triggered Protocol in a Multi-language Environment
  • Methods and Languages for Safety-Related Real-Time Programming
  • ANSI-C in Safety Critical Applications - Lessons-Learned from Software Evaluation

    Applications

  • A Structured Approach to the Formal Certification of Safety of Computer Aided Development Tools
  • Applying Formal Methods in Industry The UseGat Project
  • Increasing System Safety for By-Wire Applications in Vehicles by Using a Time Triggered Architecture
  • Fault-Tolerant Communication in Large-Scale Manipulators
  • Distributed Fault-Tolerant and Safety-Critical Application in Vehicles - A Time-Triggered Approach
  • Model Checking Safety Critical Software with SPIN: An Application to a Railway Interlocking System
  • EURIS, a Specification Method for Distributed Interlockings
  • Object Oriented Safety Analysis of an Extra High Voltage Substation Bay

    Formal Methods III - Petri Nets

  • Integration of Logical and Physical Properties of Embedded Systems by Use of Time Petri Nets
  • Safety Verification of Software Using Structured Petri Nets

    Reliability

  • Refinement of Safety-Related Hazards into Verifiable Code Assertions
  • Conceptual Comparison of Two Commonly Used Safeguarding Principles
  • A Holistic View on the Dependability of Software-Intensive Systems
  • Verifying Integrity of Decision Diagrams

    [Top]

    State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography, Leuven, Belgium, June 3-6, 1997. Revised Lectures.

  • Trends in the Fight Against Computer-Related Delinquency
  • Block Ciphers - A Survey
  • Cryptographic Primitives for Information Authentication - State of the Art
  • Recent Developments in the Design of Conventional Cryptographic Algorithms
  • Elliptic Curve Public-Key Cryptosystems - An Introduction
  • Key Management Techniques
  • Security of Computer Networks
  • Internet Security Protocols
  • Securing Internet Electronic Mail
  • GSM: Security, Services, and the SIM
  • TTPs Overview - Concepts and Review of the State of Art from a Technical Point of View
  • Management of Secret Keys: Dynamic Key Handling
  • On Solutions to the Key Escrow Problem
  • Smart Cards - Requirements, Properties, and Applications
  • Smart Card Security
  • Security Aspects of the Ecash™ Payment System
  • International Standardisation of IT Security
  • Security Management - The Process
  • Introduction to Computer Security

    [Top]

    Security Protocols, 6th International Workshop, Cambridge, UK, April 15-17, 1998, Proceedings.

  • Inductive Analysis of the Internet Protocol TLS (Position Paper)
  • Inductive Analysis of the Internet Protocol TLS (Transcript of Discussion)
  • External Consistency and the Verification of Security Protocols (Position Paper)
  • External Consistency and the Verification of Security Protocols (Transcript of Discussion)
  • The Trust Shell Game (Position Paper)
  • The Trust Shell Game (Transcript of Discussion)
  • Overview of the AT&T Labs Trust-Management Project (Position Paper)
  • Overview of the AT&T Labs Trust-Management Project (Transcript of Discussion)
  • KeyNote: Trust Management for Public-Key Infrastructures (Position Paper)
  • Discussion Session - Trust Management
  • Application-Oriented Security Policies and Their Composition (Position Paper)
  • Application-Oriented Security Policies and Their Composition (Transcript of Discussion)
  • Secure Fingerprinting Using Public-Key Cryptography (Position Paper)
  • Secure Fingerprinting Using Public-Key Cryptography (Transcript of Discussion)
  • Third Party Certification of HTTP Service Access Statistics (Position Paper)
  • Third Party Certification of HTTP Service Access Statistics (Transcript of Discussion)
  • Delegating Trust (Transcript of Discussion)
  • Delegation of Responsibility (Position Paper)
  • Delegation of Responsibility (Transcript of Discussion)
  • Abuse of Process (Transcript of Discussion)
  • A New Concept in Protocols: Verifiable Computational Delegation (Position Paper)
  • A New Concept in Protocols: Verifiable Computational Delegation (Transcript of Discussion)
  • Delegation and Not-So Smart Cards (Position Paper)
  • Delegation and Not-So Smart Card (Transcript of Discussion)
  • Certification and Delegation (Transcript of Discussion)
  • Discussion Session: Differences Between Academic and Commercial Security
  • Optimistic Trust with Realistic eNvestigators (Position Paper)
  • Optimistic Trust with Realistic eNvestigators (Transcript of Discussion)
  • Insider Fraud (Position Paper)
  • Insider Fraud (Transcript of Discussion)
  • Panel Session - Future Directions

    [Top]

    Selected Areas in Cryptography '98, SAC'98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings.

    Design of Secret Key Cryptosystems

  • Feistel Ciphers with L2-Decorrelation
  • Key-Dependent S-Box Manipulations
  • On the Twofish Key Schedule
  • Toward Provable Security of Substitution-Permutation Encryption Networks

    Randomness and Computational Issues

  • An Accurate Evaluation of Maurer's Universal Test
  • Computational Alternatives to Random Number Generators
  • Storage-Efficient Finite Field Basis Conversion
  • Verifiable Partial Sharing of Integer Fractions

    Analysis of Secret Key Cryptosystems

  • Higher Order Differential Attack Using Chosen Higher Order Differences
  • On Maximum Non-averaged Differential Probability
  • Cryptanalysis of RC4-like Ciphers

    Cryptographic Systems

  • Key Preassigned Traceability Schemes for Broadcast Encryption
  • Mix-Based Electronic Payments
  • Over the Air Service Provisioning

    Public Key Cryptosystems

  • Faster Attacks on Elliptic Curve Cryptosystems
  • Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
  • Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97
  • A Lattice-Based Public-Key Cryptosystem

    Design and Implementation of Secret Key Cryptosystems

  • Fast DES Implementation for FPGAs and Its Application to a Universal Key-Search Machine
  • IDEA: A Cipher For Multimedia Architectures
  • A Strategy for Constructing Fast Round Functions with Practical Security Against Differential and Linear Cryptanalysis
  • The Nonhomomorphicity of Boolean Functions

    Attacks on Secret Key Cryptosystems

  • Cryptanalysis of ORYX
  • A Timing Attack on RC5
  • Cryptanalysis of SPEED

    Invited Talks

  • Authenticated Diffie-Hellman Key Agreement Protocols
  • Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR

    [Top]

    Public Key Cryptography, Second International Workshop on Practice and Theory in Public Key Cryptography, PKC '99, Kamakura, Japan, March 1-3, 1999, Proceedings.

  • A New type of ``Magic Ink'' Signatures - Towards Transcript-Irrelevant Anonymity Revocation
  • A New Aspect of Dual Basis for Efficient Field Arithmetic
  • On the Security of Random Sources
  • Anonymous Fingerprinting Based on Committed Oblivious Transfer
  • How to Enhance the Security of Public-Key Encryption at Minimum Cost
  • Encrypted Message Authentication by Firewalls
  • A Relationship between One-Wayness and Correlation Intractability
  • Message Recovery Fair Blind Signature
  • On Quorum Controlled Asymmetric Proxy Re-encryption
  • Mini-Cash: A Minimalistic Approach to E-Commerce
  • Preserving Privacy in Distributed Delegation with Fast Certificates
  • Unknown Key-Share Attacks on the Station-to-Station (STS) Protocol
  • Toward Fair International Key Escrow
  • How to Copyright a Function
  • On the Security of RSA Screening
  • The Effectiveness of Lattice Attacks Against Low-Exponent RSA
  • A Trapdoor Permutation Equivalent to Factoring
  • Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
  • Evaluating Differential Fault Analysis of Unknown Cryptosystems
  • Removing Interoperability Barriers Between the X.509 and EDIFACT Public Key Infrastructures: The DEDICA Project
  • Hash Functions and the MAC Using All-or-Nothing Property
  • Decision Oracles are Equivalent to Matching Oracles
  • Shared Generation of Random Number with Timestamp: How to Cope with the Leakage of the CA's Secret
  • Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy
  • A Secure Pay-per View Scheme for Web-Based Video Service

    [Top]

    Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998.

  • Practice-Oriented Provable Security
  • Introduction to Secure Computation
  • Commitment Schemes and Zero-Knowledge Protocols
  • Emerging Standards for Public-Key Cryptography
  • Contemporary Block Ciphers
  • Primality Tests and Use of Primes in Public-Key Systems
  • Signing Contracts and Paying Electronically
  • The State of Cryptographic Hash Functions
  • The Search for the Holy Grail in Quantum Cryptography
  • Unconditional Security in Cryptography

    [Top]

    Agent Mediated Electronic Commerce, First International Workshop on Agent Mediated Electronic Trading, AMET-98, Minneapolis, MN, USA, May 10th, 1998, Selected Papers.

    Building Electronic Marketplaces with the ZEUS Agent Tool-kit
    Accounting for Cognitive Costs in On-Line Auction Design
    SICS MarketSpace - An Agent-Based Market Infrastructure
    Sequencing of Contract Types for Anytime Task Reallocation
    Agent-Mediated Integrative Negotiation for Retail Electronic Commerce
    A Multi-agent System for Coordinating International Shipping
    Bid Evaluation and Selection in the MAGNET Automated Contracting System
    Evolutionary Computing and Negotiating Agents
    Bidding Strategies for Trading Agents in Auction-Based Tournaments
    A pi-calculus Model of a Spanish Fish Market - Preliminary Report
    Information Integration for Electronic Commerce

    [Top]

    Information Security and Privacy, 4th Australasian Conference, ACISP'99, Wollongong, NSW, Australia, April 7-9, 1999, Proceedings.

    Boolean Functions

  • Boolean Function Design Using Hill Climbing Methods
  • Enumeration of Correlation Immune Boolean Functions
  • On the Symmetric Property of Homogeneous Boolean Functions

    Key Management

  • Publicly Verifiable Key Escrow with Limited Time Span
  • Accelerating Key Establishment Protocols for Mobile Communication
  • Conference Key Agreement from Secret Sharing

    Cryptanalysis

  • On m-Permutation Protection Scheme Against Modification Attack
  • Inversion Attack and Branching

    Signatures

  • Fail-Stop Threshold Signature Schemes Based on Elliptic Curves
  • Divertible Zero-Knowledge Proof of Polynominal Relations and Blind Group Signature
  • Repudiation of Cheating and Non-repudiation of Zhang's Proxy Signature Schemes

    RSA Cryptosystems

  • On the Security of an RSA Based Encryption Scheme
  • Generalised Cycling Attacks on RSA and Strong RSA Primes
  • RSA Acceleration with Field Programmable Gate Arrays

    Group Cryptography

  • Changing Thresholds in the Absence of Secure Channels
  • A Self-Certified Group-Oriented Cryptosystem Without a Combiner

    Network Security

  • Companion Viruses and the Macintosh: Threats and Countermeasures
  • An Implementation of a Secure Version of NFS Including RBAC

    Electronic Commerce

  • Group Signatures and Their Relevance to Privacy-Protecting Off-Line Electronic Cash Systems
  • Efficient Electronic Cash Using Batch Signatures
  • Evolution of Fair Non-repudiation with TTP

    Access Contol

  • Authorization in Object Oriented Databases
  • An Analysis of Access Control Models

    Odds and Ends

  • Efficient Identity Based Parameter Selection for Elliptic Curve Cryptosystems
  • Characterization of Optimal Authentication Codes with Arbitration
  • A Functional Cryptosystem Using a Group Action

    [Top]

    Advances in Cryptology - EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding.

    Cryptanalysis I

  • Cryptanalysis of RSA with Private Key d Less than N0.292
  • Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials

    Hash Functions

  • Software Performance of Universal Hash Functions

    Foundations I

  • Lower Bounds for Oblivious Transfer Reductions
  • On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
  • Conditional Oblivious Transfer and Timed-Release Encryption

    Public Key

  • An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack
  • Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
  • Secure Hash-and-Sign Signatures Without the Random Oracle

    Watermarking and Fingerprinting

  • A Note on the Limits of Collusion-Resistant Watermarks
  • Coin-Based Anonymous Fingerprinting

    Elliptic Curves

  • On the Performance of Hyperelliptic Cryptosystems
  • Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
  • Comparing the MOV and FR Reductions in Elliptic Curve Cryptography

    New Schemes

  • Unbalanced Oil and Vinegar Signature Schemes
  • Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
  • New Public Key Cryptosystems Based on the Dependent-RSA Problems

    Block Ciphers

  • Resistance Against General Iterated Attacks
  • XOR and Non-XOR Differential Probabilities
  • S-boxes with Controllable Nonlinearity

    Distributed Cryptography

  • Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
  • Efficient Multiparty Computations Secure Against an Adaptive Adversary
  • Distributed Pseudo-random Functions and KDCs

    Cryptanalysis II

  • Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
  • Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem

    Tools from Related Areas

  • An Analysis of Exponentiation Based on Formal Languages
  • Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key

    Foundations II

  • Computationally Private Information Retrieval with Polylogarithmic Communication
  • On the Concurrent Composition of Zero-Knowledge Proofs
  • Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications

    Broadcast and Multicast

  • Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question
  • Efficient Communication-Storage Tradeoffs for Multicast Encryption

    [Top]

    Secure Internet Programming, Security Issues for Mobile and Distributed Objects.

    Foundations

    Concepts

    Implementations

    [Top]

    Fast Software Encryption, 6th International Workshop, FSE '99, Rome, Italy, March 24-26, 1999, Proceedings.

    Advanced Encryption Standard

  • Improved Analysis of Some Simplified Variants of RC6
  • Linear Cryptanalysis of RC5 and RC6
  • A Revised Version of Crypton - Crypton V1.0
  • Attack on Six Rounds of Crypton
  • On Security of the 128-Bit Block Cipher DEAL
  • Cryptanalysis of a Reduced Version of the Block Cipher E2
  • On the Decorrelated Fast Cipher (DFC) and Its Theory

    Remotely Keyed Encryption

  • Scramble All, Encrypt Small
  • Accelerated Remotely Keyed Encruption

    Analysis of Block Ciphers I

  • Miss in the Middle Attacks on IDEA and Khufu
  • Mod n Cryptanalysis, with Applications Against RC5P and M6
  • The Boomerang Attack

    Miscellaneous

  • Towards Making Luby-Rackoff Ciphers Optimal and Practical
  • A New Characterization of Almost Bent Functions
  • Imprimitive Permutation Groups and Trapdoors in Iterated Block Ciphers

    Modes of Operation

  • On the Security of Double and 2-Key Triple Modes of Operation
  • On the Construction of Variable-Input-Length Ciphers

    Analysis of Block Ciphers II

  • Slide Attacks
  • On the Security of CS-Cipher
  • Interpolation Attacks of the Block Cipher: SNAKE

    Stream Ciphers

  • High-Speed Pseudorandom Number Generation with Small Memory
  • SOBER Crytanalysis

    [Top]

    Financial Cryptography, Third International Conference, FC'99, Anguilla, British West Indies, February 1999, Proceedings.

    Electronic Commerce

  • Experimenting with Electronic Commerce on the PalmPilot
  • Blinding of Credit Card Numbers in the SET Protocol

    Anonymity Control

  • Trustee Tokens: Simple and Practical Anonymous Digital Coin Tracing
  • Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems

    Fraud Management

  • Risk Management for E-Cash Systems with Partial Real-Time Audit
  • Assessment of Effectiveness of Counterfeit Transaction Detection Systems for Smart Card Based Electronic Cash

    Public-Key Certificates

  • Reasoning about Public-Key Certification: On Bindings between Entities and Public Keys
  • Online Certificate Status Checking in Financial Transactions: The Case for Re-issuance

    Steganography

  • Playing "Hide and Seek" with Stored Keys
  • On Channel Capacity and Modulation of Watermarks in Digital Still Images

    Content Distribution

  • Towards Making Broadcast Encryption Practical
  • Conditional Access Concepts and Principles
  • Fair Use, Intellectual Property, and the Information Economy (Panel Session Summary)

    Anonymity Mechanisms

  • Anonymous Authentication of Membership in Dynamic Groups
  • Some Open Issues and New Directions in Group Signatures

    Auctions and Markets

  • Anonymous Investing: Hiding the Identities of Stockholders
  • Fair On-Line Auctions without Special Trusted Parties

    Auctions and Markets

  • Cryptosystems Robust against "Dynamic Faults" Meet Enterprise Needs for Organizational "Change Control"
  • Improved Magic Ink Signatures Using Hints

    [Top]

    Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings.

    Public-Key Cryptanalysis I

  • On the Security of RSA Padding
  • Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
  • The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications

    Invited Lecture

  • Information-Theoretic Cryptography

    Secure Communication and Computation

  • Information Theoretically Secure Communication in the Limited Storage Space Model
  • The All-or-Nothing Nature of Two-Party Secure Computation

    Distributed Cryptography

  • Adaptive Security for Threshold Cryptosystems
  • Two Party RSA Key Generation
  • Robust Distributed Multiplicaton with out Interaction
  • A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic

    Secret-Key Cryptography

  • Truncated Differentials and Skipjack
  • Fast Correlation Attacks Based on Turbo Code Techniques
  • Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality

    Message Authentication Codes

  • UMAC: Fast and Secure Message Authentication
  • SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
  • Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions
  • Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier

    Public-Key Cryptoanalysis II

  • Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
  • Weakness in Quaternion Signatures
  • Cryptanalysis of ``2 R'' Schemes
  • Factoring N = prq for Large r

    Traitor Tracing

  • An Efficient Public Key Traitor Tracing Scheme
  • Dynamic Traitor Training
  • Efficient Methods for Integrating Traceability and Broadcast Encryption

    Differential Power Analysis

  • Differential Power Analysis
  • Towards Sound Approaches to Counteract Power-Analysis Attacks

    Signature Schemes

  • Separability and Efficiency for Generic Group Signature Schemes
  • A Forward-Secure Digital Signature Scheme
  • Abuse-Free Optimistic Contract Signing

    Zero Knowledge

  • Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
  • On Concurrent Zero-Knowledge with Pre-processing

    Asymmetric Encryption

  • On the Security Properties of OAEP as an All-or-Nothing Transform
  • Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization
  • Secure Integration of Asymmetric and Symmetric Encryption Schemes

    Electronic Cash

  • Auditable, Anonymous Electronic Cash Extended Abstract

    Protocols and Broadcasting

  • Oblivious Transfer with Adaptive Queries
  • Compressing Cryptographic Resources
  • Coding Constructions for Blacklisting Problems without Computational Assumptions
  • An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes

    [Top]

    Computer Safety, Reliability and Security, 18th International Conference, SAFECOMP'99, Toulouse, France, September, 1999, Proceedings.

    Invited Talk

  • Software Reliability Engineering in Industry

    Assessment and Certification

  • A Systematic Approach to Safety Case Maintenance
  • SQUALE Dependability Assessment Criteria
  • Assessment and Certification of Safety-Critical Digital Architectures - The ACRuDA Project

    Safety Assessment and Human Factors (Poster Session)

  • Safety Evaluation of a Train Leader Telephone System
  • Safety Analysis Techniques for Validating Formal Models During Verification
  • Evaluating the Contribution of DesktopVR for Safety-Critical Applications
  • Human Performance Reliability in the Design-for-Usability Life Cycle for Safety Human-Computer Interfaces
  • The Impact of Different Media on Safety and Usability of Interactive ATC Applications

    Human Factors

  • Patterns for Safer Human-Computer Interfaces
  • Impact of Communication on Systems Dependability: Human Factors Perspectives
  • A Method for Operator Error Detection Based on Plan Recognition

    Safety Assessment

  • Hierarchically Performed Hazard Origin and Propagation Studies
  • Hardware Redundant Vital Computers - Demonstration of Safety on the Basis of Current Standards

    Design for Safety (Poster Session)

  • System and Software Safety Analysis for the ERA Control Computer
  • Safety Markup Language: Concept and Application
  • Extendable Ground-to-Air Communication Architecture for CoDySa
  • Hierarchical Reliability and Safety Models of Fault Tolerant Distributed Industrial Control Systems
  • The Development of a Commercial ``Shrink-Wrapped Application'' to Safety Integrity Level 2: The DUST-EXPERTTM Story

    Verification and Testing

  • Safety Verification of Ada95 Programs Using Software Fault Trees
  • Programming Rule Static Verification for Reliable Software
  • Automated Black-Box Testing with Abstract VDM Oracles
  • Towards Statistical Control of an Industrial Test Process

    Design for Safety

  • Choosing Effective Methods for Design Diversity - How to Progress from Intuition to Science
  • A First Step Towards the Integration of Accident Reports and Constructive Design Documents
  • A Holistic Design Concept to Improve Safety Related Control Systems

    Dependability Analysis and Evaluation

  • Comparing Fault Trees and Bayesian Networks for Dependability Analysis
  • FlexFi: A Flexible Fault Injection Environment for Microprocessor-Based Systems
  • Structural Software Reliability Estimation

    Formal Methods and Security (Poster Session)

  • Hazard Analysis in Formal Specification
  • Modeling Safety-Critical Systems with Z and Petri Nets
  • On Formal Languages for Sequences of Authorization Transformations
  • Scheduling Fault-Tolerant Programs on Multiple Processors to Maximize Schedule Reliability

    Formal Methods

  • Formal Design of Distributed Control Systems with Lustre
  • Formal Specification and Development of a Safety-Critical Train Management System
  • Formal Validation of the GUARDS Inter-Consistency Mechanism
  • A Graphical Environment for the Specification and Verification of Reactive Systems

    Security

  • Dependability Requirements and Security Architectures for the Healthcare/Medical Sector
  • Three-Pass Hybrid Key Establishment Protocol Based on ESIGN Signature
  • The Integration of Safety and Security Requirements

    [Top]

    Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings.

    Invited Talk

    Asymmetric Key Cryptosystems

    Analysis

    Elliptic Curve Cryptosystems

    Public Key Cryptosystems

    Integers and Computation

    Network Security

    Random Number

    Key Management

    Authentication

    [Top]

    Cryptographic Hardware and Embedded Systems, First International Workshop, CHES'99, Worcester, MA, USA, August 12-13, 1999, Proceedings.

    Invited Talk

  • We Need Assurance

    Cryptanalytic Hardware

  • Factoring Large Numbers with the Twinkle Device (Extended Abstract)
  • DES Cracking on the Transmogrifier 2a

    Hardware Architectures

  • Modelling the Crypto-Processor from Design to Synthesis
  • A DES ASIC Suitable for Network Encryption at 10 Gbps and Beyond
  • Hardware Design and Performance Estimation of the 128-bit Block Cipher Crypton

    Smartcards and Embedded Systems

  • Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201
  • How to Implement Cost-Effective and Secure Public Key Cryptosystems

    Invited Talk

  • Montgomery's Multiplication Technique: How to Make It Smaller and Faster

    Arithmetic Algorithms I

  • A Scalable Architecture for Montgomery Multiplication
  • Arithmetic Design for Permutation Groups
  • Fast Multiplication in Finite Fields GF(2N)
  • Efficient Finite Field Basis Conversion Involving Dual Bases

    Power Attacks I

  • Power Analysis Attacks of Modular Exponentiation in Smartcards
  • DES and Differential Power Analysis (The "Duplication" Method)
  • IPA: A New Class of Power Attacks

    Invited Talk

  • Security Evaluation Schemas for the Public and Private Market with a Focus on Smart Card Systems

    True Random Number Generators

  • A Design of Reliable True Random Number Generator for Cryptographic Applications
  • Random Number Generators Founded on Signal and Information Theory

    Cryptographic Algorithms on FPGAs

  • A High-Performance Flexible Architecture for Cryptography
  • CryptoBooster: A Reconfigurable and Modular Cryptographic Coprocessor
  • Elliptic Curve Scalar Multiplier Design Using FPGAs

    Arithmetic Algorithms II

  • Highly Regular Architectures for Finite Field Computation Using Redundant Basis
  • Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis

    Power Attacks II

  • Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems
  • Probing Attacks on Tamper-Resistant Devices

    Elliptic Curve Implementations

  • Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation

    New Cryptographic Schemes and Modes of Operation

  • NICE - New Ideal Coset Encryption
  • Encryption with Statistical Self-Synchronization in Synchronous Broadband Networks

    [Top]

    Information and Communication Security, Second International Conference, ICICS'99, Sydney, Australia, November 9-11, 1999, Proceedings.

    Keynote Speech

    Cryptanalysis

    Language Based Approach to Security

    Electronic Commerce and Secret Sharing

    Digital Signatures

    Keynote Speech

    Security Protocols

    Applications

    Cryptography

    Complexity and Security Functions

    [Top]

    Information Security, Second International Workshop, ISW'99, Kuala Lumpur, Malaysia, November 1999, Proceedings.

    Electronic Money

  • Spending Programs: A Tool for Flexible Micropayments
  • Money Conservation via Atomicity in Fair Off-Line E-Cash
  • Engineering an eCash System

    Electronic Payment and Unlinkability

  • Unlinkable Electronic Coupon Protocol with Anonymity Control
  • On the Security of the Lee-Chang Group Signature Scheme and Its Derivatives

    Secure Software Components

  • Security Properties of Software Components
  • Methods for Protecting a Mobile Agent's Route
  • Non-interactive Cryptosystem for Entity Authentication

    Network Security

  • Implementation of Virtual Private Networks at the Transport Layer
  • Performance Evaluation of Certificate Revocation Using k-Valued Hash Tree
  • Active Rebooting Method for Proactivized System: How to Enhance the Security against Latent Virus Attacks

    Digital Watermarking

  • Highly Robust Image Watermarking Using Complementary Modulations
  • Region-Based Watermarking for Images
  • Digital Watermarking Robust Against JPEG Compression

    Protection of Software and Data

  • Fingerprints for Copyright Software Protection
  • A Secrecy Scheme for MPEG Video Data Using the Joint of Compression and Encryption

    Electronic Money

  • On Anonymous Electronic Cash and Crime
  • On the Difficulty of Key Recovery Systems
  • An Improvement on a Practical Secret Voting Scheme

    Digital Signatures

  • Undeniable Confirmer Signature
  • Extended Proxy Signatures for Smart Cards
  • A New Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
  • Cryptanalysis of Two Group Signature Schemes

    [Top]

    Secure Networking - CQRE (Secure) '99, International Exhibition and Congress Düsseldorf, Germany, November 30 - December 2, 1999, Proceedings.

    Risk Management

  • Developing Electronic Trust Policies Using a Risk Management Model

    Security Design

  • SECURE: A Simulation Tool for PKI Design
  • Lazy Infinite-State Analysis of Security Protocols

    Electronic Payment

  • Electronic Payments: Where Do We Go from Here?

    SmartCard Issues

  • PCA: Jini-based Personal Card Assistant
  • An X.509-Compatible Syntax for Compact Certificates

    Applications

  • Secure and Cost Efficient Electronic Stamps
  • Implementation of a Digital Lottery Server on WWW

    PKI-experiences (Workshop Notes)

  • Cert'eM: Certification System Based on Electronic Mail Service Structure
  • A Method for Developing Public Key Infrastructure Models
  • The Realities of PKI Inter-operability

    Mobile Security

  • Mobile Security - An Overview of GSM, SAT and WAP
  • Secure Transport of Authentication Data in Third Generation Mobile Phone Networks

    Cryptography

  • Extending Wiener's Attack in the Presence of Many Decrypting Exponents
  • Improving the Exact Security of Fiat-Shamir Signature Schemes

    Network Security (Workshop Notes)

  • On Privacy Issues of Internet Access Services via Proxy Servers
  • Cryptanalysis of Microsoft's PPTP Authentication Extensions (MS-CHAPv2)

    Key Recovery

  • Auto-recoverable Auto-certifiable Cryptosystems (A Survey)

    Intrusion Detection

  • A Distributed Intrusion Detection System Based on Bayesian Alarm Networks

    Interoperability

  • Interoperability Characteristics of S/MIME Products
  • The DEDICA Project: The Solution to the Interoperability Problems between the X.509 and EDIFACT Public Key Infrastructures

    Biometrics

  • Multiresolution Analysis and Geometric Measures for Biometric Identification Systems

    [Top]

    Cryptography and Coding, 7th IMA International Conference, Cirencester, UK, December 20-22, 1999, Proceedings.

  • Applications of Exponential Sums in Communications Theory
  • Some Applications of Bounds for Designs to the Cryptography
  • Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions
  • Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics
  • A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System
  • New Self-Dual Codes over GF(5)
  • Designs, Intersecting Families, and Weight of Boolean Functions
  • Coding Applications in Satellite Communication Systems
  • A Unified Code
  • Enhanced Image Coding for Noisy Channels
  • Perfectly Secure Authorization and Passive Identification for an Error Tolerant Biometric System
  • An Encoding Scheme for Dual Level Access to Broadcasting Networks
  • Photograph Signatures for the Protection of Identification Documents
  • An Overview of the Isoperimetric Method in Coding Theory
  • Rectangular Basis of a Linear Code
  • Graph Decoding of Array Error-Correcting Codes
  • Catastrophicity Test for Time-Varying Convolutional Encoders
  • Low Complexity Soft-Decision Sequential Decoding Using Hybrid Permutation for Reed-Solomon Codes
  • On Efficient Decoding of Alternant Codes over a Commutative Ring
  • Reduced Complexity Sliding Window BCJR Decoding Algorithms for Turbo Codes
  • Advanced Encryption Standard (AES) - An Update
  • The Piling-Up Lemma and Dependent Random Variables
  • A Cryptographic Application of Weil Descent
  • Edit Probability Correlation Attack on the Bilateral Stop/Go Generator
  • Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems
  • On the Combined Fermat/Lucas Probable Prime Test
  • On the Cryptanalysis of Nonlinear Sequences
  • Securing Aeronautical Telecommunications
  • Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
  • Delegated Decryption
  • Fast and Space-Efficient Adaptive Arithmetic Coding
  • Robust Protocol for Generating Shared RSA Parameters
  • Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes
  • Weaknesses in Shared RSA Key Generation Protocols
  • Digital Signature with Message Recovery and Authenticated Encryption (Signcryption) - A Comparison

    [Top]

    Public Key Cryptography, Third International Workshop on Practice and Theory in Public Key Cryptography, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings.

    [Top]

    Selected Areas in Cryptography, 6th Annual International Workshop, SAC'99, Kingston, Ontario, Canada, August 9-10, 1999, Proceedings.

    Cryptosystems and Pseudorandom Number Generators

  • A Universal Encryption Standard
  • Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator
  • Elliptic Curve Pseudorandom Sequence Generators

    Security Aspects of Block Ciphers

  • Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
  • Guesswork and Variation Distance as Measures of Cipher Security
  • Modeling Linear Characteristics of Substitution-Permutation Networks
  • Strong Linear Dependence and Unbiased Distribution of Non-propagative Vectors

    Cryptanalysis of Block Ciphers

  • Security of E2 against Truncated Differential Cryptanalysis
  • Key-Schedule Cryptanalysis of DEAL
  • Efficient Evaluation of Security against Generalized Interpolation Attack

    Efficient Implementations of Cryptosystems

  • Efficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orders
  • Improving and Extending the Lim/Lee Exponentiation Algorithm
  • Software Optimization of Decorrelation Module

    Cryptography for Network Applications

  • Pseudonym Systems
  • Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
  • Protecting a Mobile Agent's Route against Collusions
  • Photuris: Design Criteria

    [Top]

    Information Security and Cryptology - ICISC'99, Second International Conference, Seoul, Korea, December 9-10, 1999, Proceedings.

    Invited Talk

    Cryptanalysis and Cryptographic Design

    Cryptographic Theory and Computation Complexity

    Cryptographic Protocol and Authentication Design

    Digital Signature and Secret Sharing Scheme

    Electronic Cash

    [Top]

    Agent Mediated Electronic Commerce II, Towards Next-Generation Agent-Based Electronic Commerce Systems, IJCAI 1999 Workshop.

    [Top]

    Security Protocols, 7th International Workshop, Cambridge, UK, April 19-21, 1999, Proceedings.

    [Top]

    Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000, Proceeding.

    Factoring and Discrete Logarithm

  • Factorization of a 512-Bit RSA Modulus
  • An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
  • Analysis and Optimization of the TWINKLE Factoring Device

    Cryptanalysis I

  • Noisy Polynomial Interpolation and Noisy Chinese Remaindering
  • A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme
  • Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1
  • Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme

    Invited Talk

  • On the Security of 3GPP Networks

    Private Information Retrieval

  • One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
  • Single Database Private Information Retrieval Implies Oblivious Transfer

    Key Management Protocols

  • Authenticated Key Exchange Secure against Dictionary Attacks
  • Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
  • Fair Encryption of RSA Keys

    Threshold Cryptography and Digital Signatures

  • Computing Inverses over a Shared Secret Modulus
  • Practical Threshold Signatures
  • Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
  • Confirmer Signature Schemes Secure against Adaptive Adversaries

    Public-Key Encryption

  • Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
  • Using Hash Functions as a Hedge against Chosen Ciphertext Attack

    Quantum Cryptography

  • Security Aspects of Practical Quantum Cryptography
  • Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation

    Multi-party Computation and Information Theory

  • General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
  • Minimal-Latency Secure Function Evaluation
  • Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free

    Cryptanalysis II

  • New Attacks on PKCS#1 v1.5 Encryption
  • A NICE Cryptanalysis
  • Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
  • Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R)

    Invited Talk

  • Colossus and the German Lorenz Cipher - Code Breaking in WW II

    Zero-Knowledge

  • Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
  • Efficient Proofs that a Committed Number Lies in an Interval

    Symmetric Cryptography

  • A Composition Theorem for Universal One-Way Hash Functions
  • Exposure-Resilient Functions and All-or-Nothing Transforms
  • The Sum of PRPs Is a Secure PRF

    Boolean Functions and Hardware

  • Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
  • Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
  • Cox-Rower Architecture for Fast Parallel Montgomery Multiplication

    Voting Schemes

  • Efficient Receipt-Free Voting Based on Homomorphic Encryption
  • How to Break a Practical MIX and Design a New One

    Cryptanalysis III

  • Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
  • Advanced Slide Attacks

    [Top]

    Information Security and Privacy, 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000, Proceedings.

    Network Security 1

    Public Key Cryptography

    Network Security 2

    Cryptographic Implementation Issues

    Electronic Commerce 1

    Key Recovery

    Public Key Infrastructure

    Boolean Functions

    Intrusion Detection

    Codes

    Digital Signatures 1

    Secret Sharing 1

    Digital Signatures 2

    Protocols

    Electronic Commerce 2

    Secret Sharing 2

    Keynote Papers

    [Top]

    Electronic Commerce and Web Technologies, First International Conference, EC-Web 2000, London, UK, September 4-6, 2000, Proceedings.

    Web Application Design

    Construction of Adaptive Web-Applications from Reusable Components
    The WebConsultant - a Flexible Framework for Dynamic Web Applications
    Security of Electronic Business Applications - Structure and Quantification

    Intellectual Property Rights

    Towards a Secure and De-centralized Digital Watermarking Infrastructure for the Protection of Intellectual Property
    Selling Bits: A Matter of Creating Consumer Value
    A Secure Electronic Software Distribution (ESD) Protocol Based on PKC

    Security and Fairness

    An Equitably Fair On-line Auction Scheme
    An Optimistic Fair Exchange E-commerce Protocol with Automated Dispute Resolution
    Secure PC-Franking for Everyone

    Distributed Organisations

    Contracts for Cross-Organizational Workflow Management
    AllianceNet: Information Sharing, Negotiation and Decision-Making for Distributed Organizations
    MIERA: Method for Inter-Enterprise Role-Based Authorization

    Web Usage Analysis

    Visualization and Analysis of Clickstream Data of Online Stores with a Parallel Coordinate System
    An Heuristic to Capture Longer User Web Navigation Patterns
    Integrating Web Usage and Content Mining for More Effective Personalization
    Extending Content-Based Recommendation by Order-Matching and Cross-Matching Methods

    Invited Talk

    Global and Local in Electronic Commerce

    Modelling of Web Applications

    Object-Oriented Conceptual Modeling of Web Application Interfaces: the OO-HMethod Abstract Presentation Model
    Representing Web Data as Complex Objects
    Applying the Resource Description Framework to Web Engineering

    EC Success Factors

    E-commerce Site Evaluation: a Case Study
    Loyalty Program Scheme for Anonymous Payment System
    OpenSource in Electronic Commerce - A Comparative Analysis

    EC Markets

    Electronic OTC Trading in the German Wholesale Electricity Market
    On the Competition between ECNs, Stock Markets and Market Makers
    Internet Advertising: Market Structure and New Pricing Methods

    XML

    Dynamic-Agents, Workflow and XML for E-Commerce Automation
    Towards a Foundation for XML Document Databases
    An XML/XSL-based Software Architecture for Application Service Providers (ASPs)

    Web Mining

    A Search Engine for Indian Languages
    Metadata Based Web Mining for Topic-Specific Information Gathering
    Advanced Studies on Link Proposals and Knowledge Retrieval of Hypertexts with CBR

    Electronic Negotiation

    Virtual Tendering and Bidding in the Construction Sector
    Using Genetic Algorithms to Enable Automated Auctions

    Integrity and Performance

    Keeping a Very Large Website Up-to-date: Some Feasibility Results
    LRU-based Algorithms for Web Cache Replacement
    A Step towards a Suite of E-commerce Benchmarks

    Facilitating EC

    A Business Model for Charging and Accounting of Internet Services
    Facilitating Business-to-Business Electronic Commerce for Small and Medium-Sized Enterprises
    Next Generation Business-to-Business E-Commerce

    Mobile E-Commerce

    Security Issues in Mobile eCommerce
    Mobile Electronic Commerce: Emerging Issues

    [Top]

    Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings.

    XTR and NTRU

  • The XTR Public Key System
  • A Chosen-Ciphertext Attack against NTRU

    Privacy for Databases

  • Privacy Preserving Data Mining
  • Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing

    Secure Distributed Computation and Applications

  • Parallel Reducibility for Information-Theoretically Secure Computation
  • Optimistic Fair Secure Computation
  • A Cryptographic Solution to a Game Theoretic Problem

    Algebraic Cryptosystems

  • Differential Fault Attacks on Elliptic Curve Cryptosystems
  • Quantum Public-Key Cryptosystems
  • New Public-Key Cryptosystem Using Braid Groups

    Message Authentication

  • Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
  • CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
  • L-collision Attacks against Randomized MACs

    Digital Signatures

  • On the Exact Security of Full Domain Hash
  • Timed Commitments
  • A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
  • Provably Secure Partially Blind Signatures

    Cryptanalysis

  • Weaknesses in the SL2(IFs2) Hashing Scheme
  • Fast Correlation Attacks through Reconstruction of Linear Polynomials

    Traitor Tracing and Broadcast Encryption

  • Sequential Traitor Tracing
  • Long-Lived Broadcast Encryption

    Invited Talk

  • Taming the Adversary

    Symmetric Encryption

  • The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
  • On the Round Security of Symmetric-Key Cryptographic Primitives
  • New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack

    To Commit or Not to Commit

  • Efficient Non-malleable Commitment Schemes
  • Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

    Protocols

  • A Note on the Round-Complexity of Concurrent Zero-Knowledge
  • An Improved Pseudo-random Generator Based on Discrete Log
  • Linking Classical and Quantum Key Agreement: Is There ``Bound Information''

    Stream Ciphers and Boolean Functions

  • Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
  • Nonlinearity Bounds and Constructions of Resilient Boolean Functions
  • Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications

    [Top]

    Computer Security - ESORICS 2000, 6th European Symposium on Research in Computer Security, Toulouse, France, October 4-6, 2000, Proceedings.

    Personal Devices and Smart Cards

    Electronic Commerce Protocols

    Access Control

    Protocol Verification

    Internet Security

    Security Property Analysis

    Mobile Agents

    [Top]

    Computer Safety, Reliability and Security, 19th International Conference, SAFECOMP 2000, Rotterdam, The Netherlands, October 24-27, 2000, Proceedings.

    Invited Paper

  • The Ten Most Powerful Principles for Quality in (Software and) Software Organizations for Dependable Systems

    Verification and Validation

  • Empirical Assessment of Software On-Line Diagnostics Using Fault Injection
  • Speeding-Up Fault Injection Campaigns in VHDL Models
  • Specification and Verification of a Safety Shell with Statecharts and Extended Timed Graphs
  • Validation of Control System Specifications with Abstract Plant Models
  • A Constant Perturbation Method for Evaluation of Structural Diversity in Multiversion Software
  • Expert Error: The Case of Trouble-Shooting in Electronics
  • The Safety Management of Data-Driven Safety-Related Systems
  • Software Support for Incident Reporting Systems in Safety-Critical Applications

    Software Process Improvement

  • A Dependability-Explicit Model for the Development of Computing Systems
  • Deriving Quantified Safety Requirements in Complex Systems
  • Improving Software Development by Using Safe Object Oriented Development: OTCD
  • A Safety Licensable PES for SIL 4 Applications
  • Safety and Security Issues in Electric Power Industry
  • Dependability of Computer Control Systems in Power Plants
  • A Method of Analysis of Fault Trees with Time Dependencies

    Formal Methods

  • A Formal Methods Case Study: Using Light-Weight VDM for the Development of a Security System Module
  • Formal Methods: The Problem Is Education
  • Formal Methods Diffusion: Past Lessons and Future Prospects

    Invited Paper

  • Safe Tech: A Control Oriented Viewpoint

    Safety Guidelines

  • Derivation of Safety Targets for the Random Failure of Programmable Vehicle Based Systems
  • IEC 61508 - A Suitable Bases for the Certification of Safety-Critical Transport-Infrastructure Systems?

    Hardware Aspects

  • An Approach to Software Assisted Recovery from Hardware Transient Faults for Real Time Systems
  • Programmable Electronic System Design & Verification Utilizing DFM
  • SIMATIC S7-400F/FH: Safety-Related Programmable Logic Controller

    Safety Assessment 1

  • Assessment of the Reliability of Fault-Tolerant Software: A Bayesian Approach
  • Estimating Dependability of Programmable Systems Using BBNs

    Design for Safety

  • Improvements in Process Control Dependability through Internet Security Technology
  • A Survey on Safety-Critical Multicast Networking

    Invited Paper

  • Causal Reasoning about Aircraft Accidents

    Transport & Infrastructure

  • Controlling Requirements Evolution: An Avionics Case Study
  • HAZOP Analysis of Formal Models of Safety-Critical Interactive Systems
  • Failure Mode and Effect Analysis for Safety-Critical Systems with Software Components

    Safety Assessment 2

  • Risk Ordering of States in Safecharts
  • Dependability Evaluation: Model and Method Based on Activity Theory
  • Forensic Software Engineering and the Need for New Approaches to Accident Investigation

    [Top]

    [Top]

    Financial Cryptography, 4th International Conference, FC 2000 Anguilla, British West Indies, February 20-24, 2000, Proceedings.

    Digital Rights Management

  • Efficient Trace and Revoke Schemes
  • Efficient Watermark Detection and Collusion Security

    Invited Lecture (I)

  • Towards More Sensible Anti-circumvention Regulations

    Payment Systems

  • Self-Escrowed Cash against User Blackmailing
  • Blind, Auditable Membership Proofs
  • Private Selective Payment Protocols

    Financial Cryptography Tools (I)

  • Sharing Decryption in the Context of Voting or Lotteries

    Electronic Postcards

  • Postal Revenue Collection in the Digital Age
  • Signing on a Postcard

    Panel (I)

  • Payment Systems: The Next Generation

    Abuses of Systems

  • Non-repudiation in SET: Open Issues
  • Statistics and Secret Leakage
  • Analysis of Abuse-Free Contract Signing
  • Asymmetric Currency Rounding

    Financial Crypto Policies and Issues

  • The Encryption Debate in Plaintext: National Security and Encryption in the United States and Israel
  • Critical Comments on the European Directive on a Common Framework for Electronic Signatures and Certification Service Providers
  • A Response to ''Can We Eliminate Certificate Revocation Lists?''

    Anonymity

  • Self-Scrambling Anonymizers
  • Authentic Attributes with Fine-Grained Anonymity Protection
  • Resource-Efficient Anonymous Group Identification

    Financial Cryptography Tools (II)

  • Secret Key Authentication with Software-Only Verification

    Panel (II)

  • Panel: Public Key Infrastructure: PKIX, Signed XML or Something Else

    System Architectures

  • Financial Cryptography in 7 Layers
  • Capability-Based Financial Instruments

    [Top]

    Cryptographic Hardware and Embedded Systems - CHES 2000, Second International Workshop, Worcester, MA, USA, August 17-18, 2000, Proceedings.

    Invited Talk

  • Software Implementation of Elliptic Curve Cryptography over Binary Fields

    Implementation of Elliptic Curve Cryptosystems

  • Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
  • A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
  • Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor

    Power and Timing Analysis Attacks

  • Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies
  • Smartly Analyzing the Simplicity and the Power of Simple Power Analysis on Smartcards
  • Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems
  • A Timing Attack against RSA with the Chinese Remainder Theorem

    Hadrware Implementation of Block Cyphers

  • A Comparative Study of Performance of AES Final Candidates Using FPGAs
  • A Dynamic FPGA Implementation of the Serpent Block Cipher
  • A 12 Gbps DES Encryptor/Decryptor Core in an FPGA
  • A 155 Mbps Triple-DES Network Encryptor

    Hardware Architectures

  • An Energy Efficient Reconfigurable Public-Key Cryptograhpy Processor Architecture
  • High-Speed RSA Hardware Based on Barret's Modular Reduction Method
  • Data Integrity in Hardware for Modular Arithmetic
  • A Design for Modular Exponentiation Coprocessor in Mobile Telecommunication Terminals

    Invited Talk

  • How to Explain Side-Channel Leakage to Your Kids

    Power Analysis Attacks

  • On Boolean and Arithmetic Masking against Differential Power Analysis
  • Using Second-Order Power Analysis to Attack DPA Resistant Software
  • Differential Power Analysis in the Presence of Hardware Countermeasures

    Arithmetic Architectures

  • Montgomery Multiplier and Squarer in GF(2m)
  • A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
  • Montgomery Exponentiation with no Final Subtractions: Improved Results

    Physical Security and Cryptanalysis

  • Physical Security Devices for Computer Subsystems: A Survey of Attacks and Defences
  • Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis

    New Schemes and Algorithms

  • MiniPASS: Authentication and Digital Signatures in a Constrained Environment
  • Efficient Generation of Prime Numbers

    [Top]

    Information Security, Third International Workshop, ISW 2000, Wollongong, NSW, Australia, December 20-21, 2000, Proceedings.

    Multimedia Copyright Protection

  • A Watermarking Scheme Based on the Characteristic of Addition among DCT Coefficients
  • Affine Invariant Watermarks for 3D Polygonal and NURBS Based Models
  • A Steganographic Framework for Reference Colour Based Encoding and Cover Image Selection
  • Spatial-Domain Image Watermarking Robust against Compression, Filtering, Cropping, and Scaling
  • Region-Based Watermarking by Distribution Adjustment
  • Hiding Information in Color Images Using Small Color Palettes
  • An Approach to the Objective and Quantitative Evaluation of Tamper-Resistant Software
  • Characteristics of Some Binary Codes for Fingerprinting

    E-Commerce

  • An Anonymous Aution Protocol with a Single Non-trusted Center Using Binary Trees
  • Unlinkable Divisible Electronic Cash
  • Weighted One-Way Hash Chain and Its Applications
  • Linkability in Practical Electronic Cash Design
  • Towards a Practical Secure Framework for Mobile Code Commerce

    Key Management

  • Probabilistic Methods in Multicast Key Management
  • Classification of Authentication Protocols: A Practical Approach
  • Exploring Fair Exchange Protocols Using Specification Animation
  • A Practical Implementation of Hierarchically Structured Key Predistribution System and Its Evaluation

    Network Security and Access Control

  • An Efficient Protocol for Certified Electronic Mail
  • Performance Analysis of Secure Web Server Based on SSL
  • Sherlock: Commercial High Assurance Network Computing
  • The Role of the Development Process in Operating System Security

    Cryptographic Systems

  • Threshold Fail-Stop Signature Schemes Based on Discrete Logarithm and Factorization
  • A Signcryption Scheme Based on Integer Factorization

    [Top]

    Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000, Proceedings.

    Cryptanalysis I

  • Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
  • Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99
  • Why Textbook ElGamal and RSA Encryption Are Insecure
  • Cryptanalysis of the TTM Cryptosystem
  • Attacking and Repairing Batch Verification Schemes

    IACR Distinguished Lecture

  • Cryptography Everywhere

    Digital Signatures

  • Security of Signed ElGamal Encryption
  • From Fixed-Length to Arbitrary-Length RSA Padding Schemes
  • Towards Signature-Only Signature Schemes
  • A New Forward-Secure Digital Signature Scheme
  • Unconditionally Secure Digital Signature Schemes Admitting Transferability

    Protocols I

  • Efficient Secure Multi-party Computation
  • Mix and Match: Secure Function Evaluation via Ciphertexts
  • A Length-Invariant Hybrid Mix
  • Attack for Flash MIX
  • Distributed Oblivious Transfer

    Number Theoretic Algorithms

  • Key Improvements to XTR
  • Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
  • Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three
  • Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems

    Symmetric-Key Schemes I

  • Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
  • On the Pseudorandomness of Top-Level Schemes of Block Ciphers
  • Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers
  • Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography

    Protocols II

  • Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes
  • Addition of ElGamal Plaintexts
  • Improved Methods to Perform Threshold RSA
  • Commital Deniable Proofs and Electronic Campaign Finance
  • Provably Secure Metering Scheme

    Invited Lecture

  • CRYPTREC Project - Cryptographic Evaluation Project for the Japanese Electronic Government

    Fingerprinting

  • Anonymous Fingerprinting with Direct Non-repudiation
  • Efficient Anonymous Fingerprinting with Group Signatures

    Zero-Knowledge and Provable Security

  • Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
  • Zero-Knowledge and Code Obfuscation
  • A Note on Security Proofs in the Generic Model

    Boolean Functions

  • On Relationships among Avalanche, Nonlinearity, and Correlation Immunity

    Cryptanalysis II

  • Cryptanalysis of the Yi-Lam Hash
  • Power Analysis, What Is Now Possible...

    Pseudorandomness

  • Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
  • The Security of Chaffing and Winnowing
  • Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
  • Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
  • Proofs of Security for the Unix Password Hashing Algorithm

    Public-Key Encryption and Key Distribution

  • Trapdooring Discrete Logarithms on Elliptic Curves over Rings
  • Strengthening McEliece Cryptosystem
  • Password-Authenticated Key Exchange Based on RSA
  • Round-Efficient Conference Key Agreement Protocols with Provable Security

    [Top]

    [Top]

    Fast Software Encryption, 7th International Workshop, FSE 2000, New York, NY, USA, April 10-12, 2000, Proceedings.

    Specific Stream-Cipher Cryptanalysi

  • Real Time Cryptanalysis of A5/1 on a PC
  • Statistical Analysis of the Alleged RC4 Keystream Generator

    New Ciphers

  • The Software-Oriented Stream Cipher SSC2
  • Mercy: A Fast Large Block Cipher for Disk Sector Encryption

    AES Cryptanalysis 1

  • A Statistical Attack on RC6
  • Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
  • Correlations in RC6 with a Reduced Number of Rounds

    Block-Cipher Cryptanalysis 1

  • On the Interpolation Attacks on Block Ciphers
  • Stochastic Cryptanalysis of Crypton

    Power Analysis

  • Bitslice Ciphers and Power Analysis Attacks
  • Securing the AES Finalists Against Power Analysis Attacks

    General Stream-Cipher Cryptanalysis

  • Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators
  • A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
  • A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack

    AES Cryptanalysis 2

  • Improved Cryptanalysis of Rijndael
  • On the Pseudorandomness of the AES Finalists - RC6 and Serpent

    Block-Cipher Cryptanalysis 2

  • Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family
  • A Chosen-Plaintext Linear Attack on DES

    Theoretical Work

  • Provable Security against Differential and Linear Cryptanalysis for the SPN Structure
  • Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
  • Efficient Methods for Generating MARS-Like S-Boxes

    [Top]

    Agent Mediated Electronic Commerce, The European AgentLink Perspective.

    AMEC: Scientific and Technological Roadmap

    Agent-Mediated Electronic Commerce: Scientific and Technological Roadmap

    Section 1: Negotiation

    A Classification Scheme for Negotiation in Electronic Commerce
    Designing and Testing Negotiation Protocols for Electronic Commerce Applications
    Specifying the Processes and States of Negotiation
    Agents Advanced Features for Negotiation in Electronic Commerce and Virtual Organisations Formation Processes

    Section 2: Markets

    Agents, Markets, Institutions, and Protocols
    A Model for an Electronic Market Place
    On the Formal Specifications of Electronic Institutions
    Towards a Flexible Trading Process over the Internet

    Section 3: Preferences

    Modeling User Preferences and Mediating Agents in Electronic Commerce
    Agent Technologies for the Development of Adaptive Web Stores
    Constraint Satisfaction for Modelling Scalable Electronic Catalogs

    Section 4: Security

    Encrypting Java Archives and Its Application to Mobile Agent Security

    [Top]

    Agent-Mediated Electronic Commerce III, Current Issues in Agent-Based Electronic Commerce Systems (includes revised papers from AMEC 2000 Workshop).

    Electronic Negotiation Models for Agents

    Bilateral Negotiation for Agent-Mediated Electronic Commerce
    Multi-attribute Utility Theoretic Negotiation for Electronic Commerce
    On Constraint-Based Reasoning in e-Negotiation Agents

    Formal Issues for Agents that Operate on Electronic Market Places

    Integrating Interaction Protocols and Internet Protocols for Agent-Mediated E-Commerce
    Issues in the Design of Negotiation Protocols for Logic-Based Agent Communication Languages
    A Formal Description of a Practical Agent for E-Commerce

    Virtual Trading Institutions and Platforms

    A Platform for Electronic Commerce with Adaptive Agents
    Trading without Explicit Ontologies
    Customer Coalitions in Electronic Markets

    Trading Strategies for Interrelated Transactions

    Algorithm Design for Agents which Participate in Multiple Simultaneous Auctions
    Agent Strategies on DPB Auction Tournaments
    To Bid or Not To Bid Agent Strategies in Electronic Auction Games

    [Top]

    Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Cheju Island, Korea, February 13-15, 2001, Proceedings.

  • On the Security of Williams Based Public Key Encryption Scheme
  • Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
  • IND-CCA Public Key Schemes Equivalent to Factoring n=pq
  • Identification, Signature and Signcryption Using High Order Residues Modulo an RSA Composite
  • On the Security of Lenstra's Variant of DSA without Long Inversions
  • Fast Irreducibility and Subgroup Membership Testing in XTR
  • A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes
  • The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
  • A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
  • Marking: A Privacy Protecting Approach Against Blackmailing
  • Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems
  • Cryptanalysis of PKP: A New Approach
  • Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
  • Loopholes in Two Public Key Cryptosystems Using the Modular Group
  • Efficient Revocation in Group Signatures
  • A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
  • Efficient Asymmetric Self-Enforcement Scheme with Public Traceability
  • Adaptive Security for the Additive-Sharing Based Proactive RSA
  • Robust Forward-Secure Signature Schemes with Proactive Security
  • Equitability in Retroactive Data Confiscation versus Proactive Key Escrow
  • A PVSS as Hard as Discrete Log and Shareholder Separability
  • One Round Threshold Discrete-Log Key Generation without Private Channels
  • Remarks on Mix-Network Based on Permutation Networks
  • New Key Recovery in WAKE Protocol
  • Redundant Representation of Finite Fields
  • Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography
  • Efficient Implementation of Elliptic Curve Cryptosystems on the TI MSP 430x33x Family of Microcontrollers
  • Secure Server-Aided Signature Generation
  • Efficient Long-Term Validation of Digital Signatures
  • A Novel Systolic Architecture for Efficient RSA Implementation

    [Top]

    Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, July 25-26, 2000, Proceedings.

    Terminology

  • Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology

    Attacks on Systems

  • Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
  • The Disadvantages of Free MIX Routes and how to Overcome Them

    Anonymous Publishing

  • Freenet: A Distributed Anonymous Information Storage and Retrieval System
  • The Free Haven Project: Distributed Anonymous Storage Service

    Mix Systems

  • Towards an Analysis of Onion Routing Security
  • Web MIXes: A System for Anonymous and Unobservable Internet Access

    Identity Management

  • Privacy Incorporated Software Agent (PISA): Proposal for Building a Privacy Guardian for the Electronic Age
  • Identity Management Based on P3P

    Pseudonyms and Remailers

  • On Pseudonymization of Audit Data for Intrusion Detection
  • Protection Profiles for Remailer Mixes

    [Top]

    Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings.

    Cryptanalysis I

  • Analysis of IS-95 CDMA Voice Privacy
  • Attacks on Additive Encryption of Redundant Plaintext and Implications on Internet Security
  • Cryptanalysis of the ``Augmented Family of Cryptographic Parity Circuits'' Proposed at ISW'97

    Block Ciphers - New Designs

  • Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis
  • DFCv2
  • The Block Cipher Hierocrypt
  • Symmetric Block Ciphers Based on Group Bases

    Elliptic Curves and Efficient Implementations

  • Speeding up the Arithmetic on Koblitz Curves of Genus Two
  • On Complexity of Polynomial Basis Squaring in F2m

    Security Protocols and Applications

  • Dynamic Multi-threshold Metering Schemes
  • Chained Stream Authentication
  • A Global PMI for Electronic Content Distribution

    Block Ciphers and Hash Functions

  • A Polynomial-Time Universal Security Amplifier in the Class of Block Ciphers
  • Decorrelation over Infinite Domains: The Encrypted CBC-MAC Case
  • HAS-V: A New Hash Function with Variable Output Length

    Boolean Functions and Stream Ciphers

  • On Welch-Gong Transformation Sequence Generators
  • Modes of Operation of Stream Ciphers
  • LILI Keystream Generator
  • Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions

    Public Key Systems

  • Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders
  • On the Implementation of Cryptosystems Based on Real Quadratic Number Fields

    Cryptanalysis II

  • Root Finding Interpolation Attack
  • Differential Cryptanalysis of Reduced Rounds of GOST
  • Practical Security Evaluation against Differential and Linear Cryptanalyses for Feistel Ciphers with SPN Round Function

    [Top]

    Information Security and Cryptology - ICISC 2000, Third International Conference, Seoul, Korea, December 8-9, 2000, Proceedings.

  • A Note on the Higher Order Differential Attack of Block Ciphers with Two-Block Structures
  • On the Strength of KASUMI without FL Functions against Higher Order Differential Attack
  • On MISTY1 Higher Order Differential Cryptanalysis
  • Difference Distribution Attack on DONUT and Improved DONUT
  • New Results on Correlation Immunity
  • Elliptic Curves and Resilient Functions
  • Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
  • Characterization of Elliptic Curve Traces under FR-Reduction
  • A Multi-party Optimistic Non-repudiation Protocol
  • Secure Matchmaking Protocol
  • An Improved Scheme of the Gennaro-Krawczyk-Rabin Undeniable Signature System Based on RSA
  • Efficient and Secure Member Deletion in Group Signature Schemes
  • An Efficient and Practical Scheme for Privacy Protection in the E-Commerce of Digital Goods
  • An Internet Anonymous Auction Scheme
  • Efficient Sealed-Bid Auction Using Hash Chain
  • Micropayments for Wireless Communications
  • Cryptographic Applications of Sparse Polynomials over Finite Rings
  • Efficient Anonymous Fingerprinting of Electronic Information with Improved Automatic Identification of Redistributors
  • Hash to the Rescue: Space Minimization for PKI Directories
  • A Design of the Security Evaluation System for Decision Support in the Enterprise Network Security Management

    [Top]

    Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001, Proceedings.

    New Cryptosystems

  • Faster Generation of NICE-Schnorr-Type Signatures
  • New Key Agreement Protocols in Braid Group Cryptography

    RSA

  • Improving SSL Handshake Performance via Batching
  • From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes
  • An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits

    Symmetric Cryptography

  • On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys
  • Analysis of SHA-1 in Encryption Mode
  • Fast Implementation and Fair Comparison of the Final Candidates for Advanced Encryption Standard Using Field Programmable Gate Arrays

    Gambling and Lotteries

  • Fair e-Lotteries and e-Casinos
  • Secure Mobile Gambling

    Reductions

  • Formal Security Proofs for a Signature Scheme with Partial Message Recovery
  • The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
  • REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

    Flaws and Attacks

  • Security Weaknesses in Bluetooth
  • Distinguishing Exponent Digits by Observing Modular Subtractions
  • On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC

    Implementation

  • Modular Exponentiation on Fine-Grained FPGA
  • Scalable Algorithm for Montgomery Multiplication and Its Implementation on the Coarse-Grain Reconfigurable Chip
  • Software Implementation of the NIST Elliptic Curves Over Prime Fields
  • The Security of Hidden Field Equations (HFE)

    Multivariate Cryptography

  • QUARTZ, 128-Bit Long Digital Signatures
  • FLASH, a Fast Multivariate Signature Algorithm

    Number Theoretic Problems

  • Analysis of the Weil Descent Attack of Gaudry, Hess and Smart
  • Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation

    Passwords and Credentials

  • Relying Party Credentials Framework
  • Password Authentication Using Multiple Servers
  • More Efficient Password-Authenticated Key Exchange

    Protocols I

  • Improved Boneh-Shaw Content Fingerprinting
  • Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents
  • Targeted Advertising ... And Privacy Too

    Protocols II

  • Uncheatable Distributed Computations
  • Forward-Secure Threshold Signature Schemes
  • A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires

    [Top]

    E-Commerce Agents, Marketplace Solutions, Security Issues, and Supply and Demand.

  • Introduction to E-Commerce Agents: Marketplace Solutions, Security Issues, and Supply and Demand

    Marketplace Solutions

  • A Generalized Platform for the Specification, Valuation, and Brokering of Heterogeneous Resources in Electronic Markets
  • Economics of Dynamic Pricing in a Reputation Brokered Agent Mediated Marketplace
  • An Electronic Marketplace Architecture Based on Technology of Intelligent Agents and Knowledge
  • Modelling Broker Agents in Electronic Commerce of Multimedia Products and Services
  • A Brokering Protocol for Electronic Trading
  • Price Formation in Double Auctions
  • Negotiating Agents in Manufacturing Decision Making Processes
  • Evaluating Resource Bundle Derivatives for Multi-agent Negotiation of Resource Allocation

    Security Issues

  • Conversational Speech Biometrics
  • Secure Communication for Secure Agent-Based Electronic Commerce Applications
  • MA/LMA Architecture for Dealing with Malicious Agents in Agent-Mediated Electronic Markets
  • Secure Mobile Agent Digital Signatures with Proxy Certificates
  • Agent-Mediated Secure Electronic Transaction for Online Interdependent Purchases
  • An Agent-Based Micropayment System for E-Commerce
  • Security Issues in M-Commerce: A Usage-Based Taxonomy

    Supply and Demand

  • Towards Distributed Workflow Enactment with Itineraries and Mobile Agent Management
  • Enterprise Federation and Its Multi-agent Modelization
  • User-Centered Agents for Structured Information Location
  • Using a Speech Technology Agent as an Interface for E-Commerce

    [Top]

    Topics in Electronic Commerce, Second International Symposium, ISEC 2001 Hong Kong, China, April 26-28, 2001, Proceedings.

    Secure Payment

    An Efficient Multiple Merchants Payment Protocol for Secure Electronic Transactions Based on Purchase Consolidation
    A Fair Electronic Cash Scheme
    A Secure Payment Protocol Using Mobile Agents in an Untrusted Host Environment

    Trust and Security

    Building Trust for E-Commerce: Collaborating Label Bureaus
    Group-Oriented (t, n) Threshold Digital Signature Schemes with Traceable Signers
    The Implementation of Security Algorithm of Mobile Agent on Roblet

    Tools for E-Commerce Applications

    Active Page Generation via Customizing XML for Data Beans in E-Commerce Applications
    i-Cube: A Tool-Set for the Dynamic Extraction and Integration of Web Data Content

    E-Commerce Frameworks and Systems

    An Extensible, Human-Centric Framework That Promotes Universal Access to Electronic Commerce
    CBR-Responder, an Automated Customer Service for E-Commerce

    Performance and QoS

    Introducing QoS to Electronic Commerce Applications
    A Methodology and Implementation for Analytic Modeling in Electronic Commerce Applications

    E-Commerce Surveys

    Internet Based Electronic Business Framework Applications and Business to Business Standards
    Online Auction Protocols: A Comparative Study

    [Top]

    Java on Smart Cards: Programming and Security, First International Workshop, JavaCard 2000, Cannes, France, September 14, 2000, Revised Papers.

    Invited Talk

  • Formal Methods in Context: Security and Java Card

    Contributed Papers

  • A Dynamic Logic for the Formal Verification of Java Card Programs
  • The PACAP Prototype: A Tool for Detecting Java Card Illegal Flow
  • CardKt: Automated Multi-modal Deduction on Java Cards for Multi-application Security
  • A Programming and a Modelling Perspective on the Evaluation of Java Card Implementations
  • Secure Internet Smartcards
  • Issues in Smartcard Middleware
  • Open Platform Security
  • A Simple(r) Interface Distribution Mechanism for Java Card
  • Automatic Test Generation for Java-Card Applets
  • Formal Specification and Verification of JavaCard's Application Identifier Class
  • Security on Your Hand: Secure Filesystems with a ``Non-Cryptographic'' JAVA-Ring

    [Top]

    Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6-10, 2001, Proceeding.

    Elliptic Curves

  • A Memory Efficient Version of Satoh's Algorithm
  • Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
  • How Secure Are Elliptic Curves over Composite Extension Fields

    Commitments

  • Efficient and Non-interactive Non-malleable Commitment
  • How to Convert the Flavor of a Quantum Bit Commitment

    Anonymity

  • Cryptographic Counters and Applications to Electronic Voting
  • An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
  • Priced Oblivious Transfer: How to Sell Digital Goods

    Signatures and Hash Functions

  • A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
  • Practical Threshold RSA Signatures without a Trusted Dealer
  • Hash Functions: From Merkle-Damgård to Shoup

    XTR and NTRU

  • Key Recovery and Message Attacks on NTRU-Composite
  • Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
  • NSS: An NTRU Lattice-Based Signature Scheme

    Assumptions

  • The Bit Security of Paillier's Encryption Scheme and Its Applications
  • Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference

    Multiparty Protocols

  • On Adaptive vs. Non-adaptive Security of Multiparty Protocols
  • Multiparty Computation from Threshold Homomorphic Encryption
  • On Perfect and Adaptive Security in Exposure-Resilient Cryptography

    Block Ciphers

  • Cryptanalysis of Reduced-Round MISTY
  • The Rectangle Attack - Rectangling the Serpent

    Primitives

  • Efficient Amplification of the Security of Weak Pseudo-random Function Generators
  • Min-round Resettable Zero-Knowledge in the Public-Key Model

    Symmetric Ciphers

  • Structural Cryptanalysis of SASAS
  • Hyper-bent Functions
  • New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

    Key Exchange and Multicast

  • Lower Bounds for Multicast Message Authentication
  • Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
  • Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords

    Authentication and Identification

  • Identification Protocols Secure against Reset Attacks
  • Does Encryption with Redundancy Provide Authenticity
  • Encryption Modes with Almost Free Message Integrity

    [Top]

    Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security, International Workshop MMM-ACNS 2001, St. Petersburg, Russia, May 21-23, 2001, Proceedings.

    Invited Talks

  • An Intelligent Decision Support System for Intrusion Detection and Response
  • Mathematical Models of the Covert Channels
  • Open Issues in Formal Methods for Cryptographic Protocol Analysis
  • Future Directions in Role-Based Access Control Models
  • Secure Networked Computing

    Network Security Systems

  • Composability of Secrecy
  • Agent-Based Model of Computer Network Security System: A Case Study
  • Security Considerations and Models for Service Creation in Premium IP Networks
  • Secure Systems Design Technology
  • A Privacy-Enhancing e-Business Model Based on Infomediaries
  • Applying Practical Formal Methods to the Specification and Analysis of Security Properties
  • Modeling Software Tools Complex for Evaluation of Information Systems Operation Quality (CEISOQ)
  • Analyzing Separation of Duties in Petri Net Workflows

    Intrusion Detection

  • Information Security with Formal Immune Networks
  • BASIS: A Biological Approach to System Information Security
  • Learning Temporal Regularities of User Behavior for Anomaly Detection
  • Investigating and Evaluating Behavioural Profiling and Intrusion Detection Using Data Mining

    Access Control

  • Typed MSR: Syntax and Examples
  • TRBAC: A Temporal Authorization Model
  • The Set and Function Approach to Modeling Authorization in Distributed Systems
  • Fenix Secure Operating System: Principles, Models and Architecture

    Cryptography and Steganography

  • Generalized Oblivious Transfer Protocols Based on Noisy Channels
  • Controlled Operations as a Cryptographic Primitive
  • Key Distribution Protocol Based on Noisy Channel and Error Detecting Codes
  • Dynamic Group Key Management Protocol
  • SVD-Based Approach to Transparent Embedding Data into Digital Images
  • Fast Encryption Algorithm Spectr-H64
  • CVS at Work: A Report on New Failures upon Some Cryptographic Protocols
  • On Some Cryptographic Properties of Rijndael

    [Top]

    Electronic Commerce and Web Technologies, Second International Conference, EC-Web 2001 Munich, Germany, September 4-6, 2001, Proceedings.

    Invited Talk

    Just Business -Shouldn't We Have Some Fun

    Web Software Development

    An Object-Oriented Approach to Automate Web Applications Development
    Tools for the Design of User Friendly Web Applications
    EProMS: An E-commerce Based Process Model for Cooperative Software Development in Small Organisations

    XML Transformation

    Extracting Object-Oriented Database Schemas from XML DTDs Using Inheritance
    Creating XML Documents from Relational Data Sources
    Composition of XML-Transformations

    Electronic Payment

    Classification and Characteristics of Electronic Payment Systems
    An E-check Framework for Electronic Payment Systems in the Web Based Environment

    Simulation-, Case Studies

    Trader-Supported Information Markets - A Simulation Study
    An Integrated Framework of Business Models for Guiding Electronic Commerce Applications and Case Studies

    Modelling, Design, and Complex Transactions

    Models and Protocol Structures for Software Agent Based Complex E-Commerce Transactions
    A Multidimensional Approach for Modelling and Supporting Adaptive Hypermedia Systems
    Modelling the ICE Standard with a Formal Language for Information Commerce
    Managing Web Data through Views

    Security Aspects

    Applied Information Security for m-Commerce and Digital Television Environments
    Flexible Authentication with Multiple Domains of Electronic Commerce
    An Asymmetric Traceability Scheme for Copyright Protection without Trust Assumptions

    Electronic Negotiation, Trust

    An Application Architecture for Supporting Interactive Bilateral Electronic Negotiations
    Strategies for Software Agent Based Multiple Issue Negotiations

    Product Catalogs

    Automatic Construction of Online Catalog Topologies
    A Two-Layered Integration Approach for Product Information in B2B E-commerce
    A Visual One-Page Catalog Interface for Analytical Product Selection

    Web Site Engineering

    Engineering High Performance Database-Driven E-commerce Web Sites through Dynamic Content Caching
    XML Enabled Metamodeling and Tools for Cooperative Information Systems
    E-Speak - An XML Document Interchange Engine

    User Behaviour

    Feature Matrices: A Model for Efficient and Anonymous Web Usage Mining
    Faceted Preference Matching in Recommender Systems
    Pinpoint Web Searching and User Modeling on the Collaborative Kodama Agents

    Business Models and System Aspects

    Analyzing Workflow Audit Trails in Web-Based Environments with Fuzzy Logic
    Using Hypertext Composites in Structured Query and Search
    Categorizing Distribution Model Scenarios for Online Music

    [Top]

    Information Security and Privacy, 6th Australasian Conference, ACISP 2001, Sydney, Australia, July 11-13, 2001, Proceedings.

  • A Few Thoughts on E-Commerce
  • New CBC-MAC Forgery Attacks
  • Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
  • Improved Cryptanalysis of the Self-Shrinking Generator
  • Attacks Based on Small Factors in Various Group Structures
  • On Classifying Conference Key Distribution Protocols
  • Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
  • New Public-Key Cryptosystem Using Divisor Class Groups
  • First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
  • Practical Key Recovery Schemes
  • Non-deterministic Processors
  • Personal Secure Booting
  • Evaluation of Tamper-Resistant Software Deviating from Structured Programming Rules
  • A Strategy for MLS Workflow
  • Condition-Driven Integration of Security Services
  • SKETHIC: Secure Kernel Extension against Trojan Horses with Information-Carrying Codes
  • Secure and Private Distribution of Online Video and Some Related Cryptographic Issues
  • Private Information Retrieval Based on the Subgroup Membership Problem
  • A Practical English Auction with One-Time Registration
  • A User Authentication Scheme with Identity and Location Privacy
  • An End-to-End Authentication Protocol in Wireless Application Protocol
  • Error Detection and Authentication in Quantum Key Distribution
  • An Axiomatic Basis for Reasoning about Trust in PKIs
  • A Knowledge-Based Approach to Internet Authorizations
  • Applications of Trusted Review to Information Security
  • Network Security Modeling and Cyber Attack Simulation Methodology
  • Cryptographic Salt: A Countermeasure against Denial-of-Service Attacks
  • Enhanced Modes of Operation for the Encryption in High-Speed Networks and Their Impact on QoS
  • Improving the Availability of Time-Stamping Services
  • Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
  • Democratic Systems
  • Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme
  • Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates
  • How to Construct Fail-Stop Confirmer Signature Schemes
  • Signature Schemes Based on 3rd Order Shift Registers
  • Anonymous Statistical Survey of Attributes
  • Secure Mobile Agent Using Strong Non-designated Proxy Signature
  • Elliptic Curve Based Password Authenticated Key Exchange Protocols
  • Elliptic Curve Cryptography on a Palm OS Device
  • Reducing Certain Elliptic Curve Discrete Logarithms to Logarithms in a Finite Field

    [Top]

    Security Protocols, 8th International Workshop, Cambridge, UK, April 3-5, 2000, Revised Papers.

  • Keynote Address: Security Protocols and the Swiss Army Knife (Transcript of Discussion)
  • Mergers and Principals
  • Mergers and Principals (Transcript of Discussion)
  • Authentication and Naming (Transcript of Discussion)
  • Users and Trust in Cyberspace
  • Users and Trust in Cyberspace (Transcript of Discussion)
  • Interactive Identification Protocols (Transcript of Discussion)
  • Open Questions (Transcript of Discussion)
  • Looking on the Bright Side of Black-Box Cryptography (Transcript of Discussion)
  • Government Access to Keys - Panel Discussion
  • Making Sense of Specifications: The Formalization of SET
  • Making Sense of Specifications: The Formalization of SET (Transcript of Discussion)
  • Lack of Explicitness Strikes Back
  • Lack of Explicitness Strikes Back (Transcript of Discussion)
  • Review and Revocation of Access Privileges Distributed with PKI Certificates
  • Review and Revocation of Access Privileges Distributed with PKI Certificates (Transcript of Discussion)
  • The Correctness of Crypto Transaction Sets
  • The Correctness of Crypto Transaction Sets (Discussion)
  • Micro-management of Risk in a Trust-Based Billing System (Transcript of Discussion)
  • Broadening the Scope of Fault Tolerance within Secure Services
  • Broadening the Scope of Fault Tolerance within Secure Services (Transcript of Discussion)
  • DOS-Resistant Authentication with Client Puzzles
  • DOS-Resistant Authentication with Client Puzzles (Transcript of Discussion)
  • Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms
  • Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms (Transcript of Discussion)
  • Denial of Service - Panel Discussion
  • The Resurrecting Duckling - What Next
  • The Resurrecting Duckling - What Next? (Transcript of Discussion)
  • An Anonymous Auction Protocol Using "Money Escrow" (Transcript of Discussion)
  • Short Certification of Secure RSA Modulus (Transcript of Discussion)
  • Authenticating Web-Based Virtual Shops Using Signature-Embedded Marks - A Practical Analysis
  • Authentication Web-Based Virtual Shops Using Signature-Embedded Marks - A Practical Analysis (Transcript of Discussion)
  • I Cannot Tell a Lie (Transcript of Discussion)

    [Top]

    Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings.

    Foundations

  • On the (Im)possibility of Obfuscating Programs
  • Universally Composable Commitments

    Traitor Tracing

  • Revocation and Tracing Schemes for Stateless Receivers
  • Self Protecting Pirates and Black-Box Traitor Tracing

    Multi-party Computation

  • Minimal Complete Primitives for Secure Multi-party Computation
  • Robustness for Free in Unconditional Multi-party Computation
  • Secure Distributed Linear Algebra in a Constant Number of Rounds

    Two-Party Computation

  • Two-Party Generation of DSA Signatures
  • Oblivious Transfer in the Bounded Storage Model
  • Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation

    Elliptic Curves

  • Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
  • On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme
  • Identity-Based Encryption from the Weil Pairing

    OAEP

  • A Chosen Ciphertext Attack on RSA Optimal Asymmetric Encryption Padding (OAEP) as Standardized in PKCS #1 v2.0
  • OAEP Reconsidered
  • RSA-OAEP Is Secure under the RSA Assumption
  • Simplified OAEP for the RSA and Rabin Functions

    Encryption and Authentication

  • Online Ciphers and the Hash-CBC Construction
  • The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)

    Signature Schemes

  • Forward-Secure Signatures with Optimal Signing and Verifying
  • Improved Online/Offline Signature Schemes

    Protocols

  • An Efficient Scheme for Proving a Shuffle
  • An Identity Escrow Scheme with Appointed Verifiers
  • Session-Key Generation Using Human Passwords Only

    Cryptoanalysis

  • Cryptanalysis of RSA Signatures with Fixed-Pattern Padding
  • Correlation Analysis of the Shrinking Generator

    Application of Groups and Codes

  • Nonlinear Vector Resilient Functions
  • New Public Key Cryptosystem Using Finite Non Abelian Groups
  • Pseudorandomness from Braid Groups

    Broadcast and Secret Sharling

  • On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
  • Secure and Efficient Asynchronous Broadcast Protocols

    Soundness and Zero-Knowledge

  • Soundness in the Public-Key Model
  • Robust Non-interactive Zero Knowledge

    [Top]

    Smart Card Programming and Security, International Conference on Research in Smart Cards, E-smart 2001, Cannes, France, September 19-21, 2001, Proceedings.

    Invited Talk

  • Protecting Consumer Security Devices

    Contributed Paper

  • Jakarta: A Toolset for Reasoning about JavaCard
  • Mechanising a Protocol for Smart Cards
  • JCCM: Flexible Certificates for Smartcards with Java Card
  • Context Inference for Static Analysis of Java Card Object Sharing
  • Automated Test and Oracle Generation for Smart-Card Applications
  • An Internet Authorization Scheme Using Smart-Card-Based Security Kernels
  • Turning Multi-applications Smart Cards Services Available from Anywhere at Anytime: A SOAP / MOM Approach in the Context of Java Cards
  • An Operational Semantics of the Java Card Firewall
  • CardS4: Modal Theorem Proving on Java Smartcards
  • iButton Enrolment and Verification Requirements for the Pressure Sequence Smartcard Biometric
  • SIMspeak - Towards an Open and Secure Application Platform for GSM SIMs
  • On-Card Bytecode Verification for Java Card
  • Towards a Full Formal Specification of the JavaCard API
  • Protection Profiles and Generic Security Targets for Smart Cards as Secure Signature Creation Devices - Existing Solutions for the Payment Sector
  • A Flexible Invocation Framework for Java Card
  • ElectroMagnetic Analysis (EMA): Measures and Counter-Measures for Smart Cards
  • Information Leakage Attacks against Smart Card Implementations of the Elliptic Curve Digital Signature Algorithm
  • Use of Biometrics for User Verification in Electronic Signature Smartcards
  • Programming Internet Smartcard with XML Scripts
  • Public-Key-Based High-Speed Payment (Electronic Money) System Using Contact-Less Smart Cards

    [Top]

    Cryptography and Lattices, International Conference, CaLC 2001, Providence, RI, USA, March 29-30, 2001, Revised Papers.

  • An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
  • Low Secret Exponent RSA Revisited
  • Finding Small Solutions to Small Degree Polynomials
  • Fast Reduction of Ternary Quadratic Forms
  • Factoring Polynomials and 0-1 Vectors
  • Approximate Integer Common Divisors
  • Segment LLL-Reduction of Lattice Bases
  • Segment LLL-Reduction with Floating Point Orthogonalization
  • The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces
  • Dimension Reduction Methods for Convolution Modular Lattices
  • Improving Lattice Based Cryptosystems Using the Hermite Normal Form
  • The Two Faces of Lattices in Cryptology
  • A 3-Dimensional Lattice Reduction Algorithm
  • The Shortest Vector Problem in Lattices with Many Cycles
  • Multisequence Synthesis over an Integral Domain

    [Top]

    Cryptographic Hardware and Embedded Systems - CHES 2001, Third International Workshop, Paris, France, May 14-16, 2001, Proceedings.

    Invited Talk

  • Protecting Embedded Systems - The Next Ten Years

    Side Channel Attacks I

  • A Sound Method for Switching between Boolean and Arithmetic Masking
  • Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
  • Random Register Renaming to Foil DPA
  • Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks

    Rijndael Hardware Implementation

  • Architectural Optimization for a 1.82Gbits/sec VLSI Implementation of the AES Rijndael Algorithm
  • High Performance Single-Chip FPGA Rijndael Algorithm Implementations
  • Two Methods of Rijndael Implementation in Reconfigurable Hardware

    Random Number Generators

  • Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
  • Efficient Online Tests for True Random Number Generators

    Elliptic Curve Algorithms

  • The Hessian Form of an Elliptic Curve
  • Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve
  • Generating Elliptic Curves of Prime Order

    Invited Talk

  • New Directions in Croptography

    Arithmetic Architectures

  • A New Low Complexity Parallel Multiplier for a Class of Finite Fields
  • Efficient Rijndael Encryption Implementation with Composite Field Arithmetic
  • High-Radix Design of a Scalable Modular Multiplier
  • A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)

    Cryptanalysis

  • Attacks on Cryptoprocessor Transaction Sets
  • Bandwidth-Optimal Kleptographic Attacks
  • Electromagnetic Analysis: Concrete Results

    Embedded Implementations and New Ciphers

  • NTRU in Constrained Devices
  • Transparent Harddisk Encryption

    Side Channel Attacks II

  • Sliding Windows Succumbs to Big Mac Attack
  • Universal Exponentiation Algorithm
  • An Implementation of DES and AES, Secure against Some Attacks

    Hardware Implementation of Ciphers

  • Efficient Implementation of "Large" Stream Cipher Systems
  • Tradeoffs in Parallel and Serial Implementations of the International Data Encryption Algorithm IDEA
  • A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
  • Implementation of RSA Algorithm Based on RNS Montgomery Multiplication

    Side Channel Attacks on Elliptic Curve Cryptanalysis

  • Protections against Differential Analysis for Elliptic Curve Cryptography
  • Preventing SPA/DPA in ECC Systems Using the Jacobi Form
  • Hessian Elliptic Curves and Side-Channel Attacks

    [Top]

    Foundations of Security Analysis and Design, Tutorial Lectures [revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design, FOSAD 2000, Bertinoro, Italy, September 2000].

  • Mathematical Models of Computer Security
  • The Logic of Authentication Protocols
  • Access Control: Policies, Models, and Mechanisms
  • Security Goals: Packet Trajectories and Strand Spaces
  • Notes on Nominal Calculi for Security and Mobility
  • Classification of Security Properties (Part I: Information Flow)

    [Top]

    Computer Safety, Reliability and Security, 20th International Conference, SAFECOMP 2001, Budapest, Hungary, September 26-28, 2001, Proceedings.

    Invited Paper

  • Designing Safety into Medical Decisions and Clinical Processes

    Reliability Asessment and Security

  • Security Assessments of Safety Critical Systems Using HAZOPs
  • Network Security for Substation Automation Systems
  • A Bayesian Belief Network for Reliability Assessment

    Safety Case and Safety Analysis

  • Checking General Safety Criteria on UML Statecharts
  • Presenting a Safety Case - A Case Study
  • Safety Functions versus Control Functions

    Medical Systems

  • A Fail-Safe Dual Channel Robot Control for Surgery Applications

    Invited Paper

  • Modeling the Human in Human Factors

    Human Machine Interface

  • Analyzing Human-Machine Interactions in Safety-Critical Systems: A Basic Applicable Approach
  • Analysis of Incidents Involving Interactive Systems

    COTS - Components off the Shelf

  • Experimental Evaluation of Fault Handling Mechanisms
  • The COTS Debate in Perspective

    Testing

  • An Investigation on Mutation Strategies for Fault Injection into RDD-100 Models
  • A Comparison Study of the Behavior of Equivalent Algorithms in Fault Injection Experiments in Parallel Superscalar Architectures
  • The Effectiveness of Statistical Testing when Applied to Logic Systems

    Formal Methods

  • A Classification Scheme for Software Verification Tools with Regard to RTCA/DO-178B
  • Safety Patterns - The Key to Formal Specification of Safety Requirements
  • Formal Support for Fault Modelling and Analysis

    Invited Paper

  • Project Experience with IEC 61508 and Its Consequences

    Control Systems

  • About the Design of Distributed Control Systems: The Quasi-Synchronous Approach
  • Dependability Evaluation
  • Tuning of Database Audits to Improve Scheduled Maintenance in Communication Systems

    [Top]

    Information Security, 4th International Conference, ISC 2001, Malaga, Spain, October 1-3, 2001, Proceedings.

    Key Distribution

  • Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures
  • Privacy Amplification Theorem for Noisy Main Channel

    Protocols

  • Efficient Kerberized Multicast in a Practical Distributed Setting
  • Suitability of a Classical Analysis Method for E-commerce Protocols

    Enhancing Technologies

  • Hyppocrates
  • Lenient/Strict Batch Verification in Several Groups

    Privacy

  • Absolute Privacy in Voting
  • A Logical Model for Privacy Protection

    Software Protection

  • DISSECT: DIStribution for SECurity Tool
  • An Approach to the Obfuscation of Control-Flow of Sequential Computer Programs

    Message Hiding I

  • A Practical and Effective Approach to Large-Scale Automated Linguistic Steganography
  • Robust New Method in Frequency Domain Watermarking

    PKI Issues and Protocols

  • On the Complexity of Public-Key Certificate Validation
  • Liability of Certification Authorities: A Juridical Point of View

    Hardware Implementations

  • Experimental Testing of the Gigabit IPSec-Compliant Implementations of Rijndael and Triple DES Using SLAAC-1V FPGA Accelerator Board
  • Elliptic Curve Arithmetic Using SIMD
  • On the Hardware Implementation of the 3GPP Confidentiality and Integrity Algorithms
  • Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware Accelerator

    Cryptanalysis and Prevention

  • A Theoretical DPA-Based Cryptanalysis of the NESSIE Candidates FLASH and SFLASH
  • Quadratic Relations for S-Boxes: Their Minimum Representations and Bounds
  • Approximate Power Roots in Zm
  • Securing Elliptic Curve Point Multiplication against Side-Channel Attacks

    Implementations

  • A Flexible Role-Based Access Control Model for Multimedia Medical Image Database Systems
  • A Secure Publishing Service for Digital Libraries of XML Documents

    Non-repudiation Techniques

  • An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
  • Persistent Authenticated Dictionaries and Their Applications

    Contracts and Auctions

  • Efficient Optimistic N-Party Contract Signing Protocol
  • Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison

    Message Hiding II

  • Oblivious Image Watermarking Robust against Scaling and Geometric Distortions
  • Fingerprinting Text in Logical Markup Languages

    Payments

  • SPEED Protocol: Smartcard-Based Payment with Encrypted Electronic Delivery
  • Efficient Transferable Cash with Group Signatures

    Network and OS Security

  • An Auditable Metering Scheme for Web Advertisement Applications
  • Broker-Based Secure Negotiation of Intellectual Property Rights

    Network and OS Security

  • Design of the Decision Support System for Network Security Management to Secure Enterprise Network
  • Measuring False-Positive by Automated Real-Time Correlated Hacking Behavior Analysis
  • Design of UNIX System for the Prevention of Damage Propagation by Intrusion and Its Implementation Based on 4.4BSD

    [Top]

    Information and Communications Security, Third International Conference, ICICS 2001, Xian, China, November 13-16, 2001.

  • Security of Blind Discrete Log Signatures against Interactive Attacks
  • An Intelligent Intruder Model for Security Protocol Analysis
  • Primitive Polynomials over GF(2) - A Cryptologic Approach
  • Unconditionally-Secure Oblivious Transfer
  • Cryptanalysis of the Improved User Efficient Blind Signatures
  • Towards the Forgery of a Group Signature without Knowing the Group Center's Secret
  • Evaluation of the Image Degradation for a Typical Watermarking Algorithm in the Block-DCT Domain
  • A Cyclic Window Algorithm for ECC Defined over Extension Fields
  • Fast Scalar Multiplication on the Jacobian of a Family of Hyperelliptic Curves
  • Attacks on Two Digital Signature Schemes Based on Error Correcting Codes
  • A Derivative of Digital Objects and Estimation of Default Risks in Electronic Commerce
  • A New Approach for Secure Multicast Routing in a Large Scale Network
  • A Transaction Length-Sensitive Protocol Based on Altruistic Locking for Multilevel Secure Database Systems
  • Dealing with Uncertainties in Risk Analysis Using Belief Functions
  • RBAC for XML Document Stores
  • Cheating Immune Secret Sharing
  • Encryption Sticks (Randomats)
  • Applying NCP Logic to the Analysis of SSL 3.0
  • Performance of WTLS and Its Impact on an M-commerce Transaction
  • Enforcing Obligation with Security Monitors
  • Efficient Software Implementation for Finite Field Multiplication in Normal Basis
  • Playing Lottery on the Internet
  • Privacy Protection for Transactions of Digital Goods
  • Equivalent Characterizations and Applications of Multi-output Correlation-Immune Boolean Functions
  • Threshold Undeniable RSA Signature Scheme
  • Two Simple Batch Verifying Multiple Digital Signatures
  • Square Attack on Reduced Camellia Cipher
  • Generalization of Elliptic Curve Digital Signature Schemes
  • Reasoning about Accountability within Delegation
  • A Novel Data Hiding Method for Two-Color Images
  • An Identification Scheme Provably Secure against Reset Attack
  • Estimating the Scalability of the Internet Key Exchange
  • An Efficient Information Flow Analysis of Recursive Programs Based on a Lattice Model of Security Classes
  • Defeating Denial-of-Service Attacks on the Internet
  • A Role-Based Access Control Model and Implementation for Data-Centric Enterprise Applications
  • A Unified Methodology for Verification and Synthesis of Firewall Configurations
  • Quantifying Network Denial of Service: A Location Service Case Study
  • A Public Key Cryptosystem Based on the Subgroup Membership Problem
  • On a Network Security Model for the Secure Information Flow on Multilevel Secure Network
  • NIDS Research Based on Artificial Immunology
  • AMBAR Protocol: Access Management Based on Authorization Reduction
  • Chinese Remainder Theorem Based Hierarchical Access Control for Secure Group Communication
  • Dispatching Mobile Agents with Secure Routes in Parallel
  • TH-SMS: Security Management System in Advanced Computational Infrastructure
  • Cryptography and Middleware Security
  • Cryptanalysis of the Hwang-Rao Secret Error-Correcting Code Schemes
  • A Role-Based Model for Access Control in Database Federations
  • A Useful Intrusion Detection System Prototype to Monitor Multi-processes Based on System Calls
  • A Digital Nominative Proxy Signature Scheme for Mobile Communication
  • Hierarchical Simulation Model with Animation for Large Network Security
  • Fair Electronic Cash Based on a Group Signature Scheme
  • Fair Exchange of Digital Signatures with Offline Trusted Third Party
  • SECUSIM: A Tool for the Cyber-Attack Simulation
  • A New Semantics of Authentication Logic
  • Robust and Fragile Watermarking Techniques for Documents Using Bi-directional Diagonal Profiles
  • Redundancy, Obscurity, Self-Containment & Independence

    [Top]

    Electronic Commerce, Second International Workshop, WELCOM 2001 Heidelberg, Germany, November 16-17, 2001, Proceedings.

    Invited Talks

    Process Based E-services
    Digital Rights Management - Dealmaker for E-business

    Panel

    E-services: The Next Wave of Internet-Based Applications

    Trade / Markets

    A New M-commerce Concept: m-Mall
    Building Comparison-Shopping Brokers on the Web
    Trusted Mediation for E-service Provision in Electronic Marketplaces
    GAMA-Mall - Shopping in Communities
    Markets without Makers - A Framework for Decentralized Economic Coordination in Multiagent Systems
    Incentives for Sharing in Peer-to-Peer Networks

    Security / Trust

    Mobile Payments - State of the Art and Open Problems
    Using Smart Cards for Fair Exchange
    Rational Exchange - A Formal Model Based on Game Theory
    Enabling Privacy Protection in E-commerce Applications

    Auctions

    FAucS : An FCC Spectrum Auction Simulator for Autonomous Bidding Agents
    A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions

    Profiling

    User Modelling for Live Help Systems
    Multidimensional Recommender Systems: A Data Warehousing Approach

    Business Interaction

    A Multi-criteria Taxonomy of Business Models in Electronic Commerce
    Integration of Goods Delivery Supervision into E-commerce Supply Chain
    Scalable Regulation of Inter-enterprise Electronic Commerce

    [Top]

    Progress in Cryptology - INDOCRYPT 2001, Second International Conference on Cryptology in India, Chennai, India, December 16-20, 2001, Proceedings.

    Invited Lecture

  • Cryptographic Functions and Design Criteria for Block Ciphers

    Hashing

  • Mobile Agent Route Protection through Hash-Based Mechanisms
  • A New Anonymous Fingerprinting Scheme with High Enciphering Rate
  • A Parallel Algorithm for Extending Cryptographic Hash Functions
  • Incremental Hash Function Based on Pair Chaining & Modular Arithmetic Combining

    Algebraic Schemes

  • Multiples of Primitive Polynomials over GF(2)
  • Fast Generation of Cubic Irreducible Polynomials for XTR
  • Cheating Prevention in Secret Sharing over GF(pt)

    Elliptic Curves

  • An Application of Sieve Methods to Elliptic Curves
  • Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
  • A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

    Coding Theory

  • Frameproof and IPP Codes
  • Linear Authentication Codes: Bounds and Constructions

    Applications - I

  • Selective Receipt in Certified E-mail
  • Spatial Domain Digital Watermarking with Buyer Authentication
  • Efficient Public Auction with One-Time Registration and Public Verifiability
  • An Analysis of Integrity Services in Protocols

    Cryptanalysis

  • Cryptanalysis of the Nonlinear FeedForward Generator
  • Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
  • Cryptanalysis of Imai and Matsumoto Scheme B Asymmetric Cryptosystem

    Distributed Cryptography

  • Robust and Secure Broadcasting
  • Toward Optimal Player Weights in Secure Distributed Protocols

    Boolean Functions

  • Autocorrelation Properties of Correlation Immune Boolean Functions
  • On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices

    Digital Signatures

  • A Twin Algorithm for Efficient Generation of Digital Signatures
  • Efficient "on the Fly" Signature Schemes Based on Integer Factoring
  • Clock-Controlled Shift Registers and Generalized Geffe Key-Stream Generator
  • Efficient Software Implementation of Linear Feedback Shift Registers
  • Comments on a Signature Scheme Based on the Third Order LFSR Proposed at ACISP2001

    Applications - II

  • Pseudo-random Bit Generator Based on Couple Chaotic Systems and Its Applications in Stream-Cipher Cryptography
  • Re-dividing Complexity between Algorithms and Keys
  • A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function

    [Top]

    Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings.

    Lattice Based Cryptography

  • Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
  • On the Insecurity of a Server-Aided RSA Protocol
  • The Modular Inversion Hidden Number Problem

    Human Identification

  • Secure Human Identification Protocols

    Invited Talk

  • Unbelievable Security. Matching AES Security Using Public Key Systems

    Practical Public Key Cryptography

  • A Probable Prime Test with Very High Confidence for n equiv 1 mod 4
  • Computation of Discrete Logarithms in F2607
  • Speeding Up XTR
  • An Efficient Implementation of Braid Groups

    Cryptography Based on Coding Theory

  • How to Achieve a McEliece-Based Digital Signature Scheme
  • Efficient Traitor Tracing Algorithms Using List Decoding

    Block Ciphers

  • Security of Reduced Version of the Block Cipher Camellia against Truncated and Impossible Differential Cryptanalysis
  • Known-IV Attacks on Triple Modes of Operation of Block Ciphers
  • Generic Attacks on Feistel Schemes
  • A Compact Rijndael Hardware Architecture with S-Box Optimization

    Provable Security

  • Provable Security of KASUMI and 3GPP Encryption Mode f8
  • Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
  • Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case

    Threshold Cryptography

  • Fully Distributed Threshold RSA under Standard Assumptions
  • Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
  • Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks

    Two-Party Protocols

  • Oblivious Polynomial Evaluation and Oblivious Neural Learning
  • Mutually Independent Commitments

    Zero Knowledge

  • Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
  • Responsive Round Complexity and Concurrent Zero-Knowledge

    Cryptographic Building Blocks

  • Practical Construction and Analysis of Pseudo-Randomness Primitives
  • Autocorrelation Coefficients and Correlation Immunity of Boolean Functions

    Elliptic Curve Cryptography

  • An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
  • Supersingular Curves in Cryptography
  • Short Signatures from the Weil Pairing
  • Self-Blindable Credential Certificates from the Weil Pairing

    Anonymity

  • How to Leak a Secret
  • Key-Privacy in Public-Key Encryption
  • Provably Secure Fair Blind Signatures with Tight Revocation

    [Top]

    Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers.

    Cryptanalysis I

  • Weaknesses in the Key Scheduling Algorithm of RC4
  • A Practical Cryptanalysis of SSC2
  • Analysis of the E0 Encryption System

    Boolean Functions

  • Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case
  • Linear Codes in Constructing Resilient Functions with High Nonlinearity
  • New Covering Radius of Reed-Muller Codes for t-Resilient Functions
  • Generalized Zig-zag Functions and Oblivious Transfer Reductions

    Rijndael

  • A Simple Algebraic Representation of Rijndael
  • Improving the Upper Bound on the Maximum Average Linear Hull Probability for Rijndael

    Invited Talk I

  • Polynomial Reconstruction Based Cryptography

    Elliptic Curves and Efficient Implementation I

  • An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic
  • Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
  • Algorithms for Multi-exponentiation
  • Two Topics in Hyperelliptic Cryptography

    Cryptanalysis II

  • A Differential Attack on Reduced-Round SC2000
  • On the Complexity of Matsui's Attack
  • Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms

    Elliptic Curves and Efficient Implementation

  • Fast Normal Basis Multiplication Using General Purpose Processors
  • Fast Multiplication of Integers for Public-Key Applications
  • Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form
  • On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication

    Public Key Systems

  • The GH Public-Key Cryptosystem
  • XTR Extended to GF(p6m)

    Invited Talk II

  • The Two Faces of Lattices in Cryptology

    Protocol and Mac

  • New (Two-Track-)MAC Based on the Two Trails of RIPEMD
  • Key Revocation with Interval Cover Families
  • Timed-Release Cryptography

    [Top]

    Cryptography and Coding, 8th IMA International Conference, Cirencester, UK, December 17-19, 2001, Proceedings.

  • A Statistical Decoding Algorithm for General Linear Block Codes
  • On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
  • The Complete Weight Enumerator for Codes over Mn×s(Fq)
  • Further Improvement of Kumar-Rajagopalan-Sahai Coding Constructions for Blacklisting Problem
  • A Simple Soft-Input/Soft-Output Decoder for Hamming Codes
  • A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks
  • Key Recovery Attacks on MACs Based on Properties of Cryptographic APIs
  • The Exact Security of ECIES in the Generic Group Model
  • A New Ultrafast Stream Cipher Design: COS Ciphers
  • On Rabin-Type Signatures
  • Strong Adaptive Chosen-Ciphertext Attacks with Memory Dump (or: The Importance of the Order of Decryption and Validation)
  • Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps
  • Almost-Certainly Runlength-Limiting Codes
  • Weight vs. Magnetization Enumerator for Gallager Codes
  • Graph Configurations and Decoding Performance
  • A Line Code Construction for the Adder Channel with Rates Higher than Time-Sharing
  • The Synthesis of TD-Sequences and Their Application to Multi-functional Communication Systems
  • Improvement of the Delsarte Bound for tau-Designs in Finite Polynomial Metric Spaces
  • Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding
  • The Wide Trail Design Strategy
  • Undetachable Threshold Signatures
  • Improving Divide and Conquer Attacks against Cryptosystems by Better Error Detection / Correction Strategies
  • Key Recovery Scheme Interoperability - A Protocol for Mechanism Negotiation
  • Unconditionally Secure Key Agreement Protocol
  • An Efficient Stream Cipher Alpha1 for Mobile and Wireless Devices
  • Investigation of Linear Codes Possessing Some Extra Properties
  • Statistical Physics of Low Density Parity Check Error Correcting Codes
  • Generating Large Instances of the Gong-Harn Cryptosystem
  • Lattice Attacks on RSA-Encrypted IP and TCP
  • Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
  • Attacking the Affine Parts of SFLASH
  • An Identity Based Encryption Scheme Based on Quadratic Residues
  • Another Way of Doing RSA Cryptography in Hardware
  • Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers
  • A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
  • A New Undeniable Signature Scheme Using Smart Cards
  • Non-binary Block Inseparable Errors Control Codes
  • Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding

    [Top]

    Topics in Cryptology - CT-RSA 2002, The Cryptographer's Track at the RSA Conference, 2002, San Jose, CA, USA, February 18-22, 2002, Proceedings.

    Public Key Cryptography

  • On Hash Function Firewalls in Signature Schemes
  • Observability Analysis - Detecting When Improved Cryptosystems Fail

    Efficient Hardware Implementations

  • Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli
  • Montgomery in Practice: How to Do It More Efficiently in Hardware
  • MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis
  • An ASIC Implementation of the AES SBoxes

    Public Key Cryptography

  • On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
  • The Representation Problem Based on Factoring

    Symmetric Ciphers

  • Ciphers with Arbitrary Finite Domains
  • Known Plaintext Correlation Attack against RC5

    E-Commerce and Applications

  • Micropayments Revisited
  • Proprietary Certificates
  • Stateless-Recipient Certified E-Mail System Based on Verifiable Encryption

    Digital Signatures

  • RSA-Based Undeniable Signatures for General Moduli
  • Co-operatively Formed Group Signatures
  • Transitive Signature Schemes
  • Homomorphic Signature Schemes

    Public Key Encryption

  • GEM: A Generic Chosen-Ciphertext Secure Encryption Method
  • Securing "Encryption + Proof of Knowledge" in the Random Oracle Model

    Discrete Logarithm

  • Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture
  • Secure Key-Evolving Protocols for Discrete Logarithm Schemes

    [Top]

    Public Key Cryptography, 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002, Paris, France, February 12-14, 2002, Proceedings.

    Encryption Schemes

  • New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive
  • Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages
  • On Sufficient Randomness for Secure Public-Key Cryptosystems
  • Multi-recipient Public-Key Encryption with Shortened Ciphertext

    Signature Schemes

  • Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code
  • Formal Proofs for the Security of Signcryption
  • A Provably Secure Restrictive Partially Blind Signature Scheme

    Protocols I

  • M+1-st Price Auction Using Homomorphic Encryption
  • Client/Server Tradeoffs for Online Elections
  • Self-tallying Elections and Perfect Ballot Secrecy

    Protocols II

  • Efficient 1-Out-n Oblivious Transfer Schemes
  • Linear Code Implies Public-Key Traitor Tracing
  • Design and Security Analysis of Anonymous Group Identification Protocols
  • On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem

    Cryptanalysis

  • Solving Underdefined Systems of Multivariate Quadratic Equations
  • Selective Forgery of RSA Signatures with Fixed-Pattern Padding
  • New Chosen-Plaintext Attacks on the One-Wayness of the Modified McEliece PKC Proposed at Asiacrypt 2000

    Side Channels

  • SPA-Based Adaptive Chosen-Ciphertext Attack on RSA Implementation
  • A Combined Timing and Power Attack
  • A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks

    Invited Talk

  • New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report

    ECC Implementations

  • An Improved Method of Multiplication on Certain Elliptic Curves
  • An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves
  • Weierstraß Elliptic Curves and Side-Channel Attacks

    Applications

  • One-Way Cross-Trees and Their Applications
  • RSA Key Generation with Verifiable Randomness
  • New Minimal Modified Radix-r Representation with Applications to Smart Cards

    [Top]

    Information Security and Cryptology - ICISC 2001, 4th International Conference Seoul, Korea, December 6-7, 2001, Proceedings.

  • Practical Security in Public-Key Cryptography
  • A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances
  • Truncated Differential Cryptanalysis of Camellia
  • Improved Impossible Differential Cryptanalysis of Rijndael and Crypton
  • Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding
  • An IND-CCA2 Public-Key Cryptosystem with Fast Decryption
  • Improvement of Probabilistic Public Key Cryptosystems Using Discrete Logarithm
  • Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
  • Concrete Security Analysis of CTR-OFB and CTR-CFB Modes of Operation
  • Decentralized Event Correlation for Intrusion Detection
  • Enhancing the Security of Cookies
  • A New Stack Buffer Overflow Hacking Defense Technique with Memory Address Confirmation
  • Efficient Revocation Schemes for Secure Multicast
  • Binary Codes for Collusion-Secure Fingerprinting
  • Copyright Protection of Object-Oriented Software
  • Off-Line Authentication Using Watermarks
  • Slide Attacks with a Known-Plaintext Cryptanalysis
  • Constructions of Cheating Immune Secret Sharing
  • Private Computation with Shared Randomness over Broadcast Channel
  • An Optimistic Multi-party Fair Exchange Protocol with Reduced Trust Requirements
  • Practical Reasoning about Accountability in Electronic Commerce Protocols
  • Content Extraction Signatures
  • New Signcryption Schemes Based on KCDSA
  • An Efficient and Provably Secure Threshold Blind Signature
  • A Multi-signature Scheme with Signers' Intentions Secure against Active Attacks
  • A Distributed Light-Weight Authentication Model for Ad-hoc Networks
  • Design of an Authentication Protocol for Gsm Javacards
  • Secure Authorisation Agent for Cross-Domain Access Control in a Mobile Computing Environment
  • Protecting General Flexible Itineraries of Mobile Agents
  • RSA Speedup with Residue Number System Immune against Hardware Fault Cryptanalysis
  • A Countermeasure against One Physical Cryptanalysis May Benefit Another Attack
  • A Fast Scalar Multiplication Method with Randomized Projective Coordinates on a Montgomery-Form Elliptic Curve Secure against Side Channel Attacks
  • DPA Countermeasure Based on the "Masking Method"

    [Top]

    Security and Privacy in Digital Rights Management, ACM CCS-8 Workshop DRM 2001, Philadelphia, PA, USA, November 5, 2001, Revised Papers.

    Renewability

  • Discouraging Software Piracy Using Software Aging

    Fuzzy Hashing

  • New Iterative Geometric Methods for Robust Perceptual Image Hashing

    Cryptographic Techniques

  • On Crafty Pirates and Foxy Tracers
  • Efficient State Updates for Key Management
  • Collusion Secure q-ary Fingerprinting for Perceptual Content

    Privacy

  • Privacy Engineering for Digital Rights Management Systems
  • Secure Open Systems for Protecting Privacy and Digital Services
  • MPEG-4 IPMP Extensions

    Software Tamper Resistance

  • Dynamic Self-Checking Techniques for Improved Tamper Resistance
  • Protecting Software Code by Guards
  • How to Manage Persistent State in DRM Systems

    Cryptanalysis

  • A Cryptanalysis of the High-Bandwidth Digital Content Protection System

    Economics

  • Implications of Digital Rights Management for Online Music - A Business Perspective
  • From Copyright to Information Law - Implications of Digital Rights Management
  • Taking the Copy Out of Copyright

    [Top]

    Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28 - May 2, 2002, Proceedings.

    Cryptanalysis I

  • Cryptanalysis of a Pseudorandom Generator Based on Braid Groups
  • Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
  • Extending the GHS Weil Descent Attack

    Public-Key Enryption

  • Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
  • Key-Insulated Public Key Cryptosystems
  • On the Security of Joint Signature and Encryption

    Invited Talk

  • AES and the Wide Trail Design Strategy

    Information Theory & New Models

  • Indistinguishability of Random Systems
  • How to Fool an Unbounded Adversary with a Short Key
  • Cryptography in an Unbounded Computational Model

    Implementational Analysis

  • Performance Analysis and Parallel Implementation of Dedicated Hash Functions
  • Fault Injection and a Timing Channel on an Analysis Technique
  • Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms

    Stream Ciphers

  • Fast Correlation Attacks: An Algorithmic Point of View
  • BDD-Based Cryptanalysis of Keystream Generators
  • Linear Cryptanalysis of Bluetooth Stream Cipher

    Digital Signatures I

  • Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
  • Optimal Security Proofs for PSS and Other Signature Schemes

    Cryptanalysis II

  • Cryptanalysis of SFLASH
  • Cryptanalysis of the Revised NTRU Signature Scheme

    Key Exchange

  • Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
  • Universally Composable Notions of Key Exchange and Secure Channels
  • On Deniability in Quantum Key Exchange

    Modes of Operation

  • A Practice-Oriented Treatment of Pseudorandom Number Generators
  • A Block-Cipher Mode of Operation for Parallelizable Message Authentication

    Invited Talk

  • What's Trust Got to Do with It

    Digital Signatures II

  • Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods
  • From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security
  • Security Notions for Unconditionally Secure Signature Schemes

    Traitor Tracing & Id-Based Encryption

  • Traitor Tracing with Constant Transmission Rate
  • Toward Hierarchical Identity-Based Encryption

    Multiparty and Multicast

  • Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch
  • Perfectly Secure Message Transmission Revisited

    Symmetric Cryptology

  • Degree of Composition of Highly Nonlinear Functions and Applications to Higher Order Differential Cryptanalysis
  • Security Flaws Induced by CBC Padding - Applications to SSL, IPSEC, WTLS ...

    [Top]

    Advances in Data Mining, Applications in E-Commerce, Medicine, and Knowledge Management [Industrial Conference on Data Mining, Leipzig, Germany, June 2002].

    Data Mining and E-commerce

    Sequence Rules for Web Clickstream Analysis
    Data Mining of Association Rules and the Process of Knowledge Discovery in Databases
    Intelligent E-marketing with Web Mining, Personalization, and User-Adpated Interfaces

    Knowledge Management and Data Mining

    The indiGo Project: Enhancement of Experience Management and Process Learning with Moderated Discourses

    Medical Applications

    Genomic Data Explosion - The Challenge for Bioinformatics
    Case-Based Reasoning for Prognosis of Threatening Influenza Waves

    [Top]

    Financial Cryptography, 5th International Conference, FC 2001, Grand Cayman, British West Indies, February 19-22, 2002, Proceedings.

    Managing Payment Transaction Costs

  • Amortized E-Cash
  • Offline Micropayments without Trusted Hardware

    Panel (I)

  • The Practical Problems of Implementing MicroMint
  • Protecting Digital Rights
  • Aspects of Digital Rights Management and the Use of Hardware Security Devices
  • A Solution to the Napster Phenomenon: Why Value Cannot Be Created Absent the Transfer of Subjective Data
  • Golden Times for Digital Rights Management
  • Applicability of Public Key Cryptosystems to Digital Rights Management Applications

    Trust and Risk Management

  • On the Global Content PMI: Improved Copy-Protected Internet Content Distribution
  • Trust: A Collision of Paradigms

    Groups and Anonymity

  • On the Security of Homage Group Authentication Protocol
  • Anonymity without 'Cryptography'
  • Fair Tracing without Trustees

    Invited Talk

  • Why the War on Money Laundering Should Be Aborted

    Certificates and Authentication

  • Provably Secure Implicit Certificate Schemes
  • Nonmonotonicity, User Interfaces, and Risk Assessment in Certificate Revocation
  • Mutual Authentication for Low-Power Mobile Devices

    Credit Card Security

  • Off-Line Generation of Limited-Use Credit Card Numbers
  • A Security Framework for Card-Based Systems
  • SecureClick: A Web Payment System with Disposable Credit Card Numbers

    Panel (II)

  • The Business of Electronic Voting

    Marekts and Multiparty Computation

  • Privacy for the Stock Market
  • Secure Distributed Computing in a Commercial Environment

    Signatures in Financial Cryptography

  • Monotone Signatures
  • The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
  • Optimistic Fair Exchange with Transparent Signature Recovery

    Auctions

  • (M+1)st-Price Auction Protocol
  • Non-interactive Private Auctions

    [Top]

    Fast Software Encryption, 8th International Workshop, FSE 2001 Yokohama, Japan, April 2-4, 2001, Revised Papers.

    Cryptanalysis of Block Ciphers I

  • The Saturation Attack - A Bait for Twofish
  • Linear Cryptanalysis of Reduced Round Serpent
  • Cryptanalysis of the Mercy Block Cipher

    Hash Functions and Boolean Functions

  • Producing Collisions for PANAMA
  • The RIPEMD and RIPEMD Improved Variants of MD4 Are Not Collision Free
  • New Constructions of Resilient Boolean Functions with Maximal Nonlinearity

    Modes of Operations

  • Optimized Self-Synchronizing Mode of Operation
  • Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
  • Incremental Unforgeable Encryption

    Cryptanalysis of Stream Ciphers I

  • ZIP Attacks with Reduced Known Plaintext
  • Cryptanalysis of the SEAL 3.0 Pseudorandom Function Family
  • Cryptanalysis of SBLH
  • A Practical Attack on Broadcast RC4

    Cryptanalysis of Block Ciphers II

  • Improved SQUARE Attacks against Reduced-Round HIEROCRYPT
  • Differential Cryptanalysis of Q
  • Differential Cryptanalysis of Nimbus

    Cryptanalysis of Stream Ciphers II

  • Fast Correlation Attack Algorithm with List Decoding and an Application
  • Bias in the LEVIATHAN Stream Cipher
  • Analysis of SSC2

    Pseudo-Randomness

  • Round Security and Super-Pseudorandomness of MISTY Type Structure
  • New Results on the Pseudorandomness of Some Blockcipher Constructions

    FSE 2001 Special Talk

  • NESSIE: A European Approach to Evaluate Cryptographic Algorithms

    Cryptanalysis of Block Ciphers III

  • Related Key Attacks on Reduced Round KASUMI
  • Security of Camellia against Truncated Differential Cryptanalysis
  • Impossible Differential Cryptanalysis of Zodiac

    Design and Evaluation

  • The Block Cipher SC2000
  • Flaws in Differential Cryptanalysis of Skipjack
  • Efficient Algorithms for Computing Differential Properties of Addition

    [Top]

    Fast Software Encryption, 9th International Workshop, FSE 2002, Leuven, Belgium, February 4-6, 2002, Revised Papers.

    Block Cipher Cryptanalysis

  • New Results on Boomerang and Rectangle Attacks
  • Multiplicative Differentials
  • Differential and Linear Cryptanalysis of a Reduced-Round SC2000
  • Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA
  • Improved Cryptanalysis of MISTY1
  • Multiple Linear Cryptanalysis of a Reduced Round RC6

    Integral Cryptanalysis

  • On the Security of CAMELLIA against the Square Attack
  • Saturation Attacks on Reduced Round Skipjack
  • Integral Cryptanalysis

    Block Cipher Theory

  • Improved Upper Bounds of Differential and Linear Characteristic Probability for Camellia
  • The Round Functions of RIJNDAEL Generate the Alternating Group
  • Non-cryptographic Primitive for Pseudorandom Permutation

    Stream Cipher Design

  • BeepBeep: Embedded Real-Time Encryption
  • A New Keystream Generator MUGI
  • Scream: A Software-Efficient Stream Cipher

    Stream Cipher Cryptanalysis

  • Distinguishing Attacks on SOBER-t16 and t32
  • Linearity Properties of the SOBER-t32 Key Loading
  • A Time-Memory Tradeoff Attack Against LILI-128

    Odds and Ends

  • On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit: A New Construction
  • Cryptanalysis of the Modified Version of the Hash Function Proposed at PKC'98
  • Compression and Information Leakage of Plaintext

    [Top]

    [Top]

    Information Security, 5th International Conference, ISC 2002 Sao Paulo, Brazil, September 30 - October 2, 2002, Proceedings.

    Intrusion Detection and Tamper Resistance

  • Real-Time Intruder Tracing through Self-Replication
  • On the Difficulty of Protecting Private Keys in Software
  • Intrusion Detection with Support Vector Machines and Generative Models

    Cryptographic Algorithm and Attack Implementation

  • Small and High-Speed Hardware Architectures for the 3GPP Standard Cipher KASUMI
  • Fast Software Implementations of SC2000
  • Comparative Analysis of the Hardware Implementations of Hash Functions SHA-1 and SHA-512
  • Implementation of Chosen-Ciphertext Attacks against PGP and GnuPG

    Access Control and Trust Management (I)

  • Role-Based Access Control for E-commerce Sea-of-Data Applications
  • An Access Control Model for Tree Data Structures
  • A New Design of Privilege Management Infrastructure for Organizations Using Outsourced PKI

    Authentication and Privacy

  • Password Authenticated Key Exchange Based on RSA for Imbalanced Wireless Networks
  • Quantifying Privacy Leakage through Answering Database Queries
  • A New Offline Privacy Protecting E-cash System with Revokable Anonymity

    E-commerce Protocols (I)

  • Receipt-Free Sealed-Bid Auction
  • Exclusion-Freeness in Multi-party Exchange Protocols
  • A Realistic Protocol for Multi-party Certified Electronic Mail

    Signature Schemes

  • A Nyberg-Rueppel Signature for Multiple Messages and Its Batch Verification
  • Comments to the UNCITRAL Model Law on Electronic Signatures
  • An Anonymous Loan System Based on Group Signature Scheme
  • Traceability Schemes for Signed Documents

    Cryptography (I)

  • Proofs of Knowledge for Non-monotone Discrete-Log Formulae and Applications
  • Inversion/Division Systolic Architecture for Public-Key Cryptosystems in GF(2m)
  • Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF (2m)

    Access Control and Trust Management (II)

  • Conditional Cryptographic Delegation for P2P Data Sharing
  • Certification of Public Keys within an Identity Based System
  • A New Public Key Cryptosystem for Constrained Hardware

    Key Management

  • A Distributed and Computationally Secure Key Distribution Scheme
  • On Optimal Hash Tree Traversal for Interval Time-Stamping
  • An Efficient Dynamic and Distributed Cryptographic Accumulator

    Security Analysis

  • A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks
  • Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks
  • Automated Analysis of Some Security Mechanisms of SCEP
  • An Attack on a Protocol for Certified Delivery

    E-commerce Protocols (II)

  • Oblivious Counter and Majority Protocol
  • Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network
  • Fingerprinting Concatenated Codes with Efficient Identification

    Cryptography (II)

  • A Provably Secure Additive and Multiplicative Privacy Homomorphism
  • Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication with Reduced Joint Hamming Weight Representation of Scalars

    [Top]

    Computer Safety, Reliability and Security, 21st International Conference, SAFECOMP 2002, Catania, Italy, September 10-13, 2002, Proceedings.

    Human-Computer System Dependability (Joint ECCE-11 & SAFECOMP 2002)

  • Human-Computer System Dependability
  • Dependability of Joint Human-Computer Systems

    Keynote Talk

  • Dependability in the Information Society: Getting Ready for the FP6

    Human Factors

  • A Rigorous View of Mode Confusion
  • Dependability as Ordinary Action

    Security

  • Practical Solutions to Key Recovery Based on PKI in IP Security
  • Redundant Data Acquisition in a Distributed Security Compound
  • Survivability Strategy for a Security Critical Process

    Dependability Assessment (Poster Session)

  • Statistical Comparison of Two Sum-of-Disjoint-Product Algorithms for Reliability and Safety Evaluation
  • Safety and Security Analysis of Object-Oriented Models
  • The CORAS Framework for a Model-Based Risk Management Process

    Keynote Talk

  • Software Challenges in Aviation Systems

    Application of Formal Methods (Poster Session)

  • A Strategy for Improving the Efficiency of Procedure Verification
  • Verification of the SSL/TLS Protocol Using a Model Checkable Logic of Belief and Time
  • Reliability Assessment of Legacy Safety-Critical Systems Upgraded with Off-the-Shelf Components

    Reliability Assessment

  • Assessment of the Benefit of Redundant Systems
  • Estimating Residual Faults from Code Coverage

    Design for Dependability

  • Towards a Metrics Based Verification and Validation Maturity Model
  • Analysing the Safety of a Software Development Process
  • Software Criticality Analysis of COTS/SOUP

    Safety Assessment

  • Methods of Increasing Modelling Power for Safety Analysis, Applied to a Turbine Digital Control System
  • Checking Safe Trajectories of Aircraft Using Hybrid Automata
  • Model-Based On-Line Monitoring Using a State Sensitive Fault Propagation Model

    Keynote Talk

  • On Diversity, and the Elusiveness of Independence

    Design for Dependability (Poster Session)

  • An Approach to a New Network Security Architecture for Academic Environments
  • A Watchdog Processor Architecture with Minimal Performance Overhead

    Application of Formal Methods

  • Model-Checking Based on Fluid Petri Nets for the Temperature Control System of the ICARO Co-generative Plant
  • Assertion Checking Environment (ACE) for Formal Verification of C Programs
  • Safety Analysis of the Height Control System for the Elbtunnel

    Design for Dependability

  • Dependability and Configurability: Partners or Competitors in Pervasive Computing
  • Architectural Considerations in the Certification of Modular Systems
  • A Problem-Oriented Approach to Common Criteria Certification

    [Top]

    Infrastructure Security, International Conference, InfraSec 2002 Bristol, UK, October 1-3, 2002, Proceedings.

    Biometrics

  • Biometric Authentication in Infrastructure Security
  • Denial of Access in Biometrics-Based Authentication Systems

    Identification

  • A Novel Approach to Proactive Password Checking
  • Single Sign-On Architectures
  • Active Digital Credentials: Dynamic Provision of Up-to-Date Identity Information

    Analysis Process

  • How to Buy Better Testing
  • Structured Risk Analysis
  • A Model Enabling Law Compliant Privacy Protection through the Selection and Evaluation of Appropriate Security Controls

    Mobile Networks

  • Authentication and Authorization of Mobile Clients in Public Data Networks
  • A Contemporary Foreword on GSM Security

    Vulnerability Assessment and Logs

  • Vulnerability Assessment Simulation for Information Infrastructure Protection
  • Pseudonymizing Unix Log Files

    System Design

  • DPS : An Architectural Style for Development of Secure Software
  • A New Infrastructure for User Tracking Prevention and Privacy Protection in Internet Shopping
  • Different Smartcard-Based Approaches to Physical Access Control

    Formal Methods

  • Authenticity and Provability - A Formal Framework
  • Protocol Engineering Applied to Formal Analysis of Security Systems

    Cryptographic Techniques

  • Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
  • Plausible Deniability Using Automated Linguistic Stegonagraphy
  • Virtual Software Tokens - A Practical Way to Secure PKI Roaming
  • Bit-Serial AOP Arithmetic Architectures over GF (2m)
  • A Practical Distributed Authorization System for GARA
  • Design of a VPN Software Solution Integrating TCP and UDP Services

    [Top]

    Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings.

    Block Ciphers

  • Essential Algebraic Structure within the AES
  • Blockwise-Adaptive Attackers: Revisiting the (In)Security of Some Provably Secure Encryption Models: CBC, GEM, IACBC
  • Tweakable Block Ciphers

    Multi-user Oriented Cryptosystems

  • The LSD Broadcast Encryption Scheme
  • Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

    Foundations and Methodology

  • Provably Secure Steganography
  • Flaws in Applying Proof Methodologies to Signature Schemes
  • Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

    Security of Practical Protocols

  • On the Security of RSA Encryption in TLS
  • Security Analysis of IKE's Signature-Based Key-Exchange Protocol
  • GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks

    Secure Multiparty Computation

  • On 2-Round Secure Multiparty Computation
  • Private Computation - k-Connected versus 1-Connected Networks

    Public-Key Encryption

  • Analysis and Improvements of NTRU Encryption Paddings
  • Universal Padding Schemes for RSA
  • Cryptanalysis of Unbalanced RSA with Small CRT-Exponent

    Information Theory and Secret Sharing

  • Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
  • Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups

    Cipher Design and Analysis

  • A Generalized Birthday Problem
  • (Not So) Random Shuffles of RC4
  • Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

    Elliptic Curves and Abelian Varieties

  • Supersingular Abelian Varieties in Cryptology
  • Efficient Algorithms for Pairing-Based Cryptosystems
  • Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2

    Password-Based Authentication

  • Threshold Password-Authenticated Key Exchange

    Distributed Cryptosystems

  • A Threshold Pseudorandom Function Construction and Its Applications
  • Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

    Pseudorandomness and Applications

  • Hidden Number Problem with the Trace and Bit Security of XTR and LUC
  • Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security

    Variations on Signatures and Authentication

  • Threshold Ring Signatures and Applications to Ad-hoc Groups
  • Deniable Ring Authentication
  • SiBIR: Signer-Base Intrusion-Resilient Signatures

    Stream Ciphers and Boolean Functions

  • Cryptanalysis of Stream Ciphers with Linear Masking
  • The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
  • A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction

    Commitment Schemes

  • Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
  • Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

    Signature Schemes

  • Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
  • Security Proof for Partial-Domain Hash Signature Schemes

    [Top]

    E-Commerce and Web Technologies, Third International Conference, EC-Web 2002, Aix-en-Provence, France, September 2-6, 2002, Proceedings.

    Invited Talk

    Enabling Virtual Enterprises: A Case for Multi-disciplinary Research

    Auction and Negotiation Technology

    Increasing Realized Revenue in a Web Based Dutch Auction
    Strategies and Behaviours of Agents in Multi-phased Negotiations
    A New Approach to the Design of Electronic Exchanges
    Winner Determination Algorithms for Electronic Auctions: A Framework Design

    Applications

    A Web-Based E-commerce Facilitator Intermediary for Small and Medium Enterprises: A B2B/B2C Hybrid Proposal
    Extended Decision Making in Tourism Information Systems
    Identifying Arbitrage Opportunities in E-markets

    Architecture

    An Architecture for Building User-Driven Web Tasks via Web Services
    Efficient XML Data Management: An Analysis
    Commercial Tools for the Development of Personalized Web Applications: A Survey

    Agents

    An Agent-Based Hierarchical Clustering Approach for E-commerce Environments
    A Multi-agent Approach to SACReD Transactions for E-commerce Applications
    A Parallel Dispatch Model with Secure and Robust Routes for Mobile Agents
    An Agent-Based Framework for Monitoring Service Contracts

    Web Query Processing

    Constraint Search for Comparing Multiple-Incentive Merchandises
    XML Query Processing Using Signature and DTD
    Modelling and Predicting Web Page Accesses Using Burrell's Model

    Invited Talk

    Metamodelling Platforms

    Web Data Integration

    Homogeneous EDI between Heterogeneous Web-Based Tourism Information Systems
    A Model for XML Schema Integration

    Security and Privacy I

    XML-Based Distributed Access Control System
    Transactional Security for a Distributed Reputation Management System
    Practical Mobile Digital Signatures
    Secure Client Agent Environment (SCAE) for World Wide Web

    Recommender Systems

    User Preference Mining through Collaborative Filtering and Content Based Filtering in Recommender System
    An Improved Recommendation Algorithm in Collaborative Filtering
    Series of Dynamic Targeted Recommendations

    Emerging Standards

    A Study of Content Conversion between eBook Standards
    Web-Based System Configuration and Performance Evaluation Using a Knowledge-Based Methodology
    Mapping UML Web Navigation Stereotypes to XML Data Skeletons
    KAON - Towards a Large Scale Semantic Web

    Security and Privacy II

    Privacy Protection through Unlinkability of Customer Activities in Business Processes Using Mobile Agents
    Secure Electronic Copyright Distribution with Public Key Based Traitor Tracing
    Watermark Embedding Mechanism Using Modulus-Based for Intellectual Property Protection on Image Data
    A Juridical Validation of a Contract Signing Protocol

    Business Models

    Designing Business Processes in E-commerce Applications
    A Generic SLA Semantic Model for the Execution Management of E-business Outsourcing Contracts

    E-payment

    A Formal and Executable Specification of the Internet Open Trading Protocol
    Using EMV Cards to Protect E-commerce Transactions
    Standardized Payment Procedures as Key Enabling Factor for Mobile Commerce

    Position Paper

    Some Thoughts on Research Perspectives in E-business

    [Top]

    Security Protocols, 9th International Workshop, Cambridge, UK, April 25-27, 2001, Revised Papers.

  • Keynote Address: Mobile Computing versus Immobile Security
  • Experiences of Mobile IP Security
  • Denial-of-Service, Address Ownership, and Early Authentication in the IPv6 World
  • Denial of Service, Address Ownership, and Early Authentication in the IPv6 World (Transcript of Discussion)
  • Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols
  • Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols (Transcript of Discussion)
  • Thwarting Timing Attacks Using ATM Networks
  • Thwarting Timing Attacks Using ATM Networks (Transcript of Discussion)
  • Towards a Survivable Security Architecture for Ad-Hoc Networks
  • Towards a Survivable Security Architecture for Ad-Hoc Networks (Transcript of Discussion)
  • PIM Security
  • PIM Security (Transcript of Discussion)
  • Merkle Puzzles Revisited - Finding Matching Elements Between Lists
  • Merkle Puzzles Revisited (Transcript of Discussion)
  • Encapsulating Rules of Prudent Security Engineering
  • Encapsulating Rules of Prudent Security Engineering (Transcript of Discussion)
  • A Multi-OS Approach to Trusted Computer Systems
  • A Multi-OS Approach to Trusted Computer Systems (Transcript of Discussion)
  • A Proof of Non-repudiation
  • A Proof of Non-repudiation (Transcript of Discussion)
  • Using Authority Certificates to Create Management Structures
  • Using Attribute Certificates for Creating Management Structures (Transcript of Discussion)
  • Trust Management and Whether to Delegate
  • Trust Management and Whether to Delegate (Transcript of Discussion)
  • You Can't Take It with You
  • Protocols Using Keys from Faulty Data
  • Protocols Using Keys from Faulty Data (Transcript of Discussion)
  • On the Negotiation of Access Control Policies
  • Negotiation of Access Control Policies (Transcript of Discussion)
  • Intrusion-Tolerant Group Management in Enclaves
  • Lightweight Authentication in a Mobile Network (Transcript of Discussion)
  • Bluetooth Security - Fact or Fiction? (Transcript of Discussion)
  • Concluding Discussion: When Does Confidentiality Harm Security
  • The Last Word

    [Top]

    Advances in Cryptology - ASIACRYPT 2002, 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings.

  • Analysis of Bernstein's Factorization Circuit
  • A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order
  • Looking beyond XTR
  • Bounds for Robust Metering Schemes and Their Relationship with A-code
  • Unconditionally Secure Anonymous Encryption and Group Authentication
  • Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
  • On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
  • A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
  • Efficient Oblivious Transfer in the Bounded-Storage Model
  • In How Many Ways Can You Write Rijndael
  • On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
  • Threshold Cryptosystems Based on Factoring
  • Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
  • Asynchronous Secure Communication Tolerating Mixed Adversaries
  • Amplified Boomerang Attack against Reduced-Round SHACAL
  • Enhancing Differential-Linear Cryptanalysis
  • Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
  • Analysis of Neural Cryptography
  • The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
  • A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2
  • A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme
  • On Unconditionally Secure Robust Distributed Key Distribution Centers
  • Short Signatures in the Random Oracle Model
  • The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
  • Transitive Signatures Based on Factoring and RSA
  • 1-out-of-n Signatures from a Variety of Keys
  • A Revocation Scheme with Minimal Storage at Receivers
  • Optimistic Mixing for Exit-Polls
  • Improved Construction of Nonlinear Resilient S-Boxes
  • An Upper Bound on the Number of m-Resilient Boolean Functions
  • Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks
  • Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
  • ID-Based Blind Signature and Ring Signature from Pairings
  • Hierarchical ID-Based Cryptography
  • Crypto-integrity
  • Gummy and Conductive Silicone Rubber Fingers

    [Top]

    Computer Security - ESORICS 2002, 7th European Symposium on Research in Computer Security, Zurich, Switzerland, October 14-16, 2002, Proceedings.

  • Computational Probabilistic Non-interference
  • Bit-Slice Auction Circuit
  • Confidentiality Policies and Their Enforcement for Controlled Query Evaluation
  • Cardinality-Based Inference Control in Sum-Only Data Cubes
  • Outbound Authentication for Programmable Secure Coprocessors
  • Hamming Weight Attacks on Cryptographic Hardware - Breaking Masking Defense
  • A Fully Compliant Research Implementation of the P3P Standard for Privacy Protection: Experiences and Recommendations
  • Authentication for Distributed Web Caches
  • Analysing a Stream Authentication Protocol Using Model Checking
  • Equal To The Task
  • TINMAN: A Resource Bound Security Checking System for Mobile Code
  • Confidentiality-Preserving Refinement is Compositional - Sometimes
  • Formal Security Analysis with Interacting State Machines
  • Decidability of Safety in Graph-Based Models for Access Control
  • Inter-Packet Delay Based Correlation for Tracing Encrypted Connections through Stepping Stones
  • Learning Fingerprints for a Database Intrusion Detection System

    [Top]

    Management Technologies for E-Commerce and E-Business Applications, 13th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, DSOM 2002, Montreal, Canada, October 21-23, 2002, Proceedings.

    Keynote Speakers

    More Research Is Indeed Needed in E-commerce; Where Were Business Academicians When We Needed Them
    Cool to Critical: Managing Web Services Now

    Panel Session

    Enforcing QoS: Myth or Reality? (Panel)

    Managing Qualit of Service

    Modeling of Service-Level Agreements for Composed Services
    The Architecture of NG-MON: A Passive Network Monitoring System for High-Speed IP Networks
    Automated SLA Monitoring for Web Services
    Optimizing Quality of Service Using Fuzzy Control

    Measuring Quality of Service

    Interaction Translation Methods for XML/SNMP Gateway
    Measuring Application Response Times with the CIM Metrics Model
    Quality Aspects in IT Service Management

    Service Architectures

    Replication and Notification Management in a Knowledge Delivery Network
    Delivering Service Adaptation with 3G Technology
    Remote Code Browsing, a Network Based Computation Utility

    Policy and Process

    Performance Study of COPS over TLS and IPsec Secure Session
    A Criteria Catalog Based Methodology for Analyzing Service Management Processes
    A Comparative Study of Policy Specification Languages for Secure Distributed Applications

    Fault Analysis

    Two Dimensional Time-Series for Anomaly Detection and Regulation in Adaptive Systems
    A Hot-Failover State Machine for Gateway Services and Its Application to a Linux Firewall
    Distributed Fault Localization in Hierarchically Routed Networks

    [Top]

    Information and Communications Security, 4th International Conference, ICICS 2002, Singapore, December 9-12, 2002, Proceedings.

    System Security I

  • Defenses against the Truncation of Computation Results of Free-Roaming Agents
  • A Distributed Dynamic µFirewall Architecture with Mobile Agents and KeyNote Trust Management System
  • Encoding Function Pointers and Memory Arrangement Checking against Buffer Overflow Attack
  • An Evaluation of Different IP Traceback Approaches
  • Security against Inference Attacks on Negative Information in Object-Oriented Databases

    Cryptosystem I

  • Robust Key-Evolving Public Key Encryption Schemes
  • A Group Signature Scheme Committing the Group
  • Unconditionally Secure Key Insulated Cryptosystems: Models, Bounds and Constructions
  • Anonymous Fingerprinting as Secure as the Bilinear Diffie-Hellman Assumption
  • Reducing the Memory Complexity of Type-Inference Algorithms

    Security Protocol I

  • The Risks of Compromising Secret Information
  • Password-Authenticated Key Exchange between Clients with Different Passwords
  • Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction
  • Attacking Predictable IPsec ESP Initialization Vectors

    Fingerprinting & Watermaking

  • An ID Coding Scheme for Fingerprinting, Randomized c-Secure CRT Code
  • A Robust Block Oriented Watermarking Scheme in Spatial Domain
  • A Flexibly Revocable Key-Distribution Scheme for Efficient Black-Box Tracing

    Efficient Implementation of Algorithms

  • Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields
  • Fast Elliptic Curve Multiplications with SIMD Operations
  • Further Results on Multiples of Primitive Polynomials and Their Products over GF(2)

    System Security II

  • A Secure Object Sharing Scheme for Java Card
  • IDS Interoperability and Correlation Using IDMEF and Commodity Systems
  • A Synthetic Fraud Data Generation Methodology
  • User Interaction Design for Secure Systems
  • Using Independent Auditors as Intrusion Detection Systems

    Cryptosystems II

  • Cellular Automata Based Cryptosystem (CAC)
  • New Weak-Key Classes of IDEA
  • Risks with Raw-Key Masking - The Security Evaluation of 2-Key XCBC
  • A New Statistical Testing for Symmetric Ciphers and Hash Functions
  • Message Authentication Codes with Error Correcting Capabilities

    Access Control

  • The Consistency of an Access Control List
  • Knowledge-Based Modeling and Simulation of Network Access Control Mechanisms Representing Security Policies
  • A Specification Language for Distributed Policy Control
  • Access Control Infrastructure for Digital Objects

    Security Protocol II

  • Distributed Key Generation as a Component of an Integrated Protocol
  • A Secure Agent-Mediated Payment Protocol

    Cryptanalysis & Cryptographic Techniques

  • Tensor Transform of Boolean Functions and Related Algebraic and Probabilistic Properties
  • Related-Cipher Attacks
  • A Chosen Plaintext Linear Attack on Block Cipher CIKS-1
  • Ideal Threshold Schemes from Orthogonal Arrays
  • Cryptanalysis of the Reduced-Round RC6

    [Top]

    Cryptographic Hardware and Embedded Systems - CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, August 13-15, 2002, Revised Papers.

    Invited Talk

  • CHES: Past, Present, and Future

    Attack Strategies

  • Optical Fault Induction Attacks
  • Template Attacks
  • The EM Side-Channel(s)

    Finite Field and Modular Arithmetic I

  • Enhanced Montgomery Multiplication
  • New Algorithm for Classical Modular Inverse
  • Increasing the Bitlength of a Crypto-Coprocessor

    Elliptic Curve Cryptography I

  • Enhancing Simple Power-Analysis Attacks on Elliptic Curve Cryptosystems
  • Implementation of Elliptic Curve Cryptography with Built-In Counter Measures against Side Channel Attacks
  • Secure Elliptic Curve Implementations: An Analysis of Resistance to Power-Attacks in a DSP Processor
  • Address-Bit Differential Power Analysis of Cryptographic Schemes OK-ECDH and OK-ECDSA

    AES and AES Candidates

  • 2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis
  • Efficient Software Implementation of AES on 32-Bit Platforms
  • An Optimized S-Box Circuit Architecture for Low Power AES Design
  • Simplified Adaptive Multiplicative Masking for AES
  • Multiplicative Masking and Power Analysis of AES

    Tamper Resistance

  • Keeping Secrets in Hardware: The Microsoft Xbox™ Case Study

    RSA Implementation

  • A DPA Attack against the Modular Reduction within a CRT Implementation of RSA
  • Further Results and Considerations on Side Channel Attacks on RSA
  • Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures

    Finite Field and Modular Arithmetic II

  • Some Security Aspects of the M IST Randomized Exponentiation Algorithm
  • The Montgomery Powering Ladder
  • DPA Countermeasures by Improving the Window Method
  • Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions

    Elliptic Curve Cryptography II

  • On the Efficient Generation of Elliptic Curves over Prime Fields
  • An End-to-End Systems Approach to Elliptic Curve Cryptography
  • A Low-Power Design for an Elliptic Curve Digital Signature Chip
  • A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n)
  • Genus Two Hyperelliptic Curve Coprocessor

    Random Number Generation

  • True Random Number Generator Embedded in Reconfigurable Hardware
  • Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications
  • A Hardware Random Number Generator

    Invited Talk

  • RFID Systems and Security and Privacy Implications

    New Primitives

  • A New Class of Invertible Mappings

    Finite Field and Modular Arithmetic II

  • Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
  • Dual-Field Arithmetic Unit for GF(p) and GF(2m)
  • Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
  • Hardware Implementation of Finite Fields of Characteristic Three

    Elliptic Curve Cryptography III

  • Preventing Differential Analysis in GLV Elliptic Curve Scalar Multiplication
  • Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks
  • Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick

    Hardware for Cryptanalysis

  • Experience Using a Low-Cost FPGA Design to Crack DES Keys
  • A Time-Memory Tradeoff Using Distinguished Points: New Analysis & FPGA Results

    [Top]

    Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems, AAMAS 2002 Workshop on Agent Mediated Electronic Commerce, Bologna, Italy, July 16, 2002, Revised Papers.

    Auctions

    A Comparison among Bidding Algorithms for Multiple Auctions
    Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints
    Differential -Revelation VCG Mechanisms for Combinatorial Auctions
    An English Auction Protocol for Multi-attribute Items
    Effectiveness of Preference Elicitation in Combinatorial Auctions
    Auctions for Divisible Resources: Price Functions, Nash Equilibrium, and Decentralized Update Schemes
    Price-Based Information Certificates for Minimal-Revelation Combinatorial Auctions
    Co-evolutionary Auction Mechanism Design: A Preliminary Report
    ATTac-2001: A Learning, Autonomous Bidding Agent

    Negotiation

    A Software Infrastructure for Negotiation within Inter-organisational Alliances
    The Influence of Information on Negotiation Equilibrium
    Using an Annealing Mediator to Solve the Prisoners' Dilemma in the Negotiation of Complex Contracts
    Automated Negotiation in Many-to-Many Markets for Imperfectly Substitutable Goods
    An Ontology Based Approach to Automated Negotiation

    Markets

    Goodwill Hunting: An Economically Efficient Online Feedback Mechanism for Environments with Variable Product Quality
    Guaranteeing Properties for E-commerce Systems
    An Extensible Agent Architecture for a Competitive Market-Based Allocation of Consumer Attention Space
    Self-Enforcing Strategic Demand Reduction
    Skeletal Jade Components for the Construction of Institutions
    Challenges in Large-Scale Open Agent Mediated Economies

    [Top]

    Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002.

    Invited Talks

  • Security of a Wide Trail Design
  • Fast Algorithms for Determining the Linear Complexity of Period Sequences

    Symmetric Ciphers

  • A New Class of Stream Ciphers Combining LFSR and FCSR Architectures
  • Slide Attack on Spectr-H64
  • On Differential Properties of Pseudo-Hadamard Transform and Related Mappings

    New Public-Key Schemes

  • A Variant of NTRU with Non-invertible Polynomials
  • Tree Replacement and Public Key Cryptosystem

    Foundations

  • Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System
  • Asynchronous Unconditionally Secure Computation: An Efficiency Improvement

    Public-Key Infrastructures

  • QPKI: A QoS-Based Architecture for Public-Key Infrastructure (PKI)
  • Towards Logically and Physically Secure Public-Key Infrastructures

    Fingerprinting and Watermarking

  • Cryptanalysis of Optimal Differential Energy Watermarking (DEW) and a Modified Robust Scheme
  • A 2-Secure Code with Efficient Tracing Algorithm
  • Reed Solomon Codes for Digital Fingerprinting

    Public-Key Protocols

  • A Note on the Malleability of the El Gamal Cryptosystem
  • Authentication of Concast Communication
  • Self-certified Signatures
  • Identity Based Authenticated Group Key Agreement Protocol

    Boolean Functions

  • Construction of Cryptographically Important Boolean Functions
  • Evolving Boolean Functions Satisfying Multiple Criteria
  • Further Results Related to Generalized Nonlinearity

    Efficient and Secure Implementations

  • Modular Multiplication in GF(pk) Using Lagrange Representation
  • Speeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map
  • Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks

    Applications

  • The Design and Implementation of Improved Secure Cookies Based on Certificate
  • A Certified E-mail System with Receiver's Selective Usage of Delivery Authority
  • Spending Offline Divisible Coins with Combining Capability
  • Efficient Object-Based Stream Authentication

    Anonymity

  • The Security of a Mix-Center Based on a Semantically Secure Cryptosystem
  • New Identity Escrow Scheme for Anonymity Authentication

    Secret Sharing and Oblivious Transfer

  • On Unconditionally Secure Distributed Oblivious Transfer
  • Non-perfect Secret Sharing over General Access Structures
  • On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

    [Top]

    Public Key Cryptography - PKC 2003, 6th International Workshop on Theory and Practice in Public Key Cryptography, Miami, FL, USA, January 6-8, 2003, Proceedings.

    Diffie-Hellman Based Schemes

  • Efficient Construction of (Distributed) Verifiable Random Functions
  • An Identity-Based Signature from Gap Diffie-Hellman Groups

    Threshold Cryptography

  • Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
  • An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack

    Reduction Proofs

  • On the Bit Security of NTRUEncrypt
  • Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks

    Broadcast and Tracing

  • Randomness Re-use in Multi-recipient Encryption Schemeas
  • Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack

    Digital Signatures

  • The Cramer-Shoup Strong-RSASignature Scheme Revisited
  • Strong Key-Insulated Signature Schemes

    Specialized Multiparty Cryptography

  • A Verifiable Secret Shuffle of Homomorphic Encryptions
  • Round-Optimal Contributory Conference Key Agreement

    Cryptanalysis I

  • Security Analysis of the MOR Cryptosystem
  • A Practical Attack on Some Braid Group Based Cryptographic Primitives

    Elliptic Curves

  • A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
  • Validation of Elliptic Curve Public Keys
  • Exceptional Procedure Attackon Elliptic Curve Cryptosystems

    Implementation and Hardware Issues

  • On Montgomery-Like Representationsfor Elliptic Curves over GF(2k)
  • A Dedicated Sieving Hardware
  • A Fast and Secure Implementation of Sflash

    New Public Key Schemes

  • A Practical Public Key Cryptosystemfrom Paillier and Rabin Schemes
  • A Lattice Based Public Key Cryptosystem Using Polynomial Representations

    Elliptic Curves

  • The Security of DSA and ECDSA
  • Side-Channel Attacks on Textbook RSA and ElGamal Encryption
  • On the Security of HFE, HFEv- and Quartz
  • Generic Attacks and the Security of Quartz

    [Top]

    Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers.

    Invited Talks

  • Some Applications of Polynomials for the Design of Cryptographic Protocols
  • Secure Multi-party Computation Made Simple

    Forward Security

  • Forward Secrecy in Password-Only Key Exchange Protocols
  • Weak Forward Security in Mediated RSA

    Foundations of Cryptography

  • On the Power of Claw-Free Permutations
  • Equivocable and Extractable Commitment Schemes
  • An Improved Pseudorandom Generator Based on Hardness of Factoring
  • Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal Assumptions

    Key Management

  • Efficient Re-keying Protocols for Multicast Encryption
  • On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure
  • A Group Key Distribution Scheme with Decentralised User Join

    Cryptanalysis

  • On a Resynchronization Weakness in a Class of Combiners with Memory
  • On Probability of Success in Linear and Differential Cryptanalysis
  • Differential Cryptanalysis of a Reduced-Round SEED

    System Security

  • Medical Information Privacy Assurance: Cryptographic and System Aspects
  • A Format-Independent Architecture for Run-Time Integrity Checking of Executable Code

    Signature Schemes

  • How to Repair ESIGN
  • Forward-Secure Signatures with Fast Key Update
  • Constructing Elliptic Curves with Prescribed Embedding Degrees
  • A Signature Scheme with Efficient Protocols

    Zero Knowledge

  • Efficient Zero-Knowledge Proofs for Some Practical Graph Problems
  • Reduction Zero-Knowledge
  • A New Notion of Soundness in Bare Public-Key Model

    Information Theory and Secret Sharing

  • Robust Information-Theoretic Private Information Retrieval
  • Trading Players for Efficiency in Unconditional Multiparty Computation
  • Secret Sharing Schemes on Access Structures with Intersection Number Equal to One

    [Top]

    Information Security and Cryptology - ICISC 2002, 5th International Conference Seoul, Korea, November 28-29, 2002, Revised Papers.

    Invited Talk

  • Cut-&-Paste Attacks with JAVA

    Digital Signatures

  • Provably Secure Encrypt-then-Sign Composition in Hybrid Signcryption
  • New DSA-Verifiable Signcryption Schemes
  • Convertible Group Undeniable Signatures
  • An Efficient Fail-Stop Signature Scheme Based on Factorization
  • On the Security of the Li-Hwang-Lee-Tsai Threshold Group Signature Scheme

    Internet Security

  • System Specification Based Network Modeling for Survivability Testing Simulation
  • A Risk-Sensitive Intrusion Detection Model
  • Applet Verification Strategiesfor RAM-Constrained Devices

    Block/Stream Ciphers

  • Sliding Properties of the DES Key Schedule and Potential Extensions to the Slide Attacks
  • Consistent Differential Patterns of Rijndael
  • Hardware Design and Analysisof Block Cipher Components
  • Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt

    Stream Ciphers & Other Primitives

  • On the Efficiency of theClock Control Guessing Attack
  • Balanced Shrinking Generators
  • On the Universal Hash Functionsin Luby-Rackoff Cipher
  • Threshold MACs
  • Ideal Threshold Schemes from MDS Codes

    Efficient Implementations

  • New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms
  • Efficient Computations of the Tate Pairingfor the Large MOV Degrees
  • Improved Techniques for Fast Exponentiation
  • Efficient Hardware Multiplicative Inverters

    Side-Channel Attacks

  • Ways to Enhance Differential Power Analysis
  • A Simple Power-Analysis (SPA) Attackon Implementations of the AES Key Expansion
  • A Reject Timing Attackon an IND-CCA2 Public-Key Cryptosystem
  • Hardware Fault Attackon RSA with CRT Revisited

    Cryptographic Protocols I

  • Receipt-Free Electronic Voting Scheme with a Tamper-Resistant Randomizer
  • Non-interactive Auction Schemewith Strong Privacy
  • An Anonymous Buyer-Seller Watermarking Protocol with Anonymity Control
  • Speeding Up Secure Sessions Establishment on the Internet

    Cryptographic Protocols II

  • On Fairness in Exchange Protocols
  • A Model for Embedding and Authorizing Digital Signatures in Printed Documents
  • A Dynamic Group Key Distribution Scheme with Flexible User Join
  • Efficient Multicast Key Management for Stateless Receivers

    Biometrics

  • Fingerprint Verification System Involving Smart Card
  • A Fast Fingerprint Matching Algorithm Using Parzen Density Estimation

    [Top]

    Selected Areas in Cryptography, 9th Annual International Workshop, SAC 2002, St. John's, Newfoundland, Canada, August 15-16, 2002. Revised Papers.

    Elliptic Curve Enhancements

  • Modifications of ECDSA
  • Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
  • Analysis of the Gallant-Lambert-Vanstone Method Based on Efficient Endomorphisms: Elliptic and Hyperelliptic Curves

    SNOW

  • Guess-and-Determine Attacks on SNOW
  • A New Version of the Stream Cipher SNOW

    Encryption Schemes

  • Encryption-Scheme Security in the Presence of Key-Dependent Messages
  • On the Security of CTR + CBC-MAC
  • Single-Path Authenticated-Encryption Scheme Based on Universal Hashing

    Differential Attacks

  • Markov Truncated Differential Cryptanalysis of Skipjack
  • Higher Order Differential Attack of Camellia (II)
  • Square-like Attacks on Reduced Rounds of IDEA
  • Full-Round Differential Attack on the Original Version of the Hash Function Proposed at PKC'98

    Boolean Functions and Stream Ciphers

  • On Propagation Characteristics of Resilient Functions
  • Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q)
  • Multiples of Primitive Polynomials and Their Products over GF(2)
  • A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function

    Block Cipher Security

  • White-Box Cryptography and an AES Implementation
  • Luby-Rackoff Ciphers: Why XOR Is Not So Exclusive

    Signatures and Secret Sharing

  • New Results on Unconditionally Secure Distributed Oblivious Transfer
  • Efficient Identity Based Signature Schemes Based on Pairings
  • The Group Diffie-Hellman Problems

    MAC and Hash Constructions

  • Secure Block Ciphers Are Not Sufficient for One-Way Hash Functions in the Preneel-Govaerts-Vandewalle Model
  • An Efficient MAC for Short Messages

    RSA and XTR Enhancements

  • Optimal Extension Fields for XTR
  • On Some Attacks on Multi-prime RSA

    [Top]

    Topics in Cryptology - CT-RSA 2003, The Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003, Proceedings.

    Key Self-protection

  • Forward-Security in Private-Key Cryptography
  • Intrusion-Resilient Public-Key Encryption

    Message Authentication

  • TMAC: Two-Key CBC MAC
  • Montgomery Prime Hashing for Message Authentication

    Digital Signatures

  • An Analysis of Proxy Signatures: Is a Secure Channel Necessary
  • Invisibility and Anonymity of Undeniable and Confirmer Signatures

    Pairing Based Cryptography

  • A Secure Signature Scheme from Bilinear Maps
  • Access Control Using Pairing Based Cryptography

    Multivariate and Lattice Problems

  • NTRUSIGN: Digital Signatures Using the NTRU Lattice
  • About the XL Algorithm over GF(2)

    Cryptographic Architectures

  • Efficient GF(pm) Arithmetic Architectures for Cryptographic Applications
  • Hardware Performance Characterization of Block Cipher Structures

    New RSA-based Cryptosystems

  • Simple Identity-Based Cryptography with Mediated RSA
  • Two Birds One Stone: Signcryption Using RSA

    Invited Talk I

  • Cryptography after the Bubble: How to Make an Impact on the World

    Chosen-Ciphertext Security

  • Rethinking Chosen-Ciphertext Security under Kerckhoffs' Assumption
  • Provably Secure Public-Key Encryptionfor Length-Preserving Chaumian Mixes

    Broadcast Encryption and PRF Sharing

  • Fault Tolerant and Distributed Broadcast Encryption
  • Shared Generation of Pseudo-Random Functions with Cumulative Maps

    Authentication Structures

  • Authenticated Data Structures for Graph and Geometric Searching
  • Fractal Merkle Tree Representation and Traversal

    Invited Talk II

  • RSA Shortcuts

    Elliptic Curves and Pairings

  • The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks
  • Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

    Threshold Cryptography

  • Two Efficient and Provably Secure Schemes for Server-Assisted Threshold Signatures
  • Secure Applications of Pedersen's Distributed Key Generation Protocol

    Implementation Issues

  • Seeing through MIST Given a Small Fraction of an RSA Private Key
  • Simple Backdoors for RSA Key Generation

    [Top]


    (Last updated: 22/05/03)