year |
venue |
title |
pages |
2000 | asiacrypt | Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis | 274-288 |
2000 | asiacrypt | Unconditionally Secure Digital Signature Schemes Admitting Transferability | 130-142 |
2000 | asiacrypt | From Fixed-Length to Arbitrary-Length RSA Padding Schemes | 90-96 |
2000 | asiacrypt | 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 | online |
2000 | asiacrypt | Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers | 303-316 |
2000 | asiacrypt | Round-Efficient Conference Key Agreement Protocols with Provable Security | 614-628 |
2000 | asiacrypt | On Relationships among Avalanche, Nonlinearity, and Correlation Immunity | 470-482 |
2000 | asiacrypt | Cryptanalysis of the Yi-Lam Hash | 483-488 |
2000 | asiacrypt | Proofs of Security for the Unix Password Hashing Algorithm | 560-572 |
2000 | asiacrypt | Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques | 546-559 |
2000 | asiacrypt | Efficient Secure Multi-party Computation | 143-161 |
2000 | asiacrypt | Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers | 1-13 |
2000 | asiacrypt | A New Forward-Secure Digital Signature Scheme | 116-129 |
2000 | asiacrypt | Towards Signature-Only Signature Schemes | 97-115 |
2000 | asiacrypt | CRYPTREC Project - Cryptographic Evaluation Project for the Japanese Electronic Government | 399-400 |
2000 | asiacrypt | Power Analysis, What Is Now Possible | 489-502 |
2000 | asiacrypt | Efficient Anonymous Fingerprinting with Group Signatures | 415-428 |
2000 | asiacrypt | Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes | 331-345 |
2000 | asiacrypt | Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three | 248-258 |
2000 | asiacrypt | Provably Secure Metering Scheme | 388-398 |
2000 | asiacrypt | Key Improvements to XTR | 220-233 |
2000 | asiacrypt | A Length-Invariant Hybrid Mix | 178-191 |
2000 | asiacrypt | Trapdooring Discrete Logarithms on Elliptic Curves over Rings | 573-584 |
2000 | asiacrypt | Strengthening McEliece Cryptosystem | 585-598 |
2000 | asiacrypt | Distributed Oblivious Transfer | 205-219 |
2000 | asiacrypt | The Security of Chaffing and Winnowing | 517-530 |
2000 | asiacrypt | Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm | 531-545 |
2000 | asiacrypt | Password-Authenticated Key Exchange Based on RSA | 599-613 |
2000 | asiacrypt | Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems | 259-273 |
2000 | asiacrypt | Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography | 317-330 |
2000 | asiacrypt | Cryptography Everywhere | 72 |
2000 | asiacrypt | Anonymous Fingerprinting with Direct Non-repudiation | 401-414 |
2000 | asiacrypt | Why Textbook ElGamal and RSA Encryption Are Insecure | 30-43 |
2000 | asiacrypt | Attacking and Repairing Batch Verification Schemes | 58-71 |
2000 | asiacrypt | Attack for Flash MIX | 192-204 |
2000 | asiacrypt | Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications | 503-516 |
2000 | asiacrypt | Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99 | 14-29 |
2000 | asiacrypt | On the Pseudorandomness of Top-Level Schemes of Block Ciphers | 289-302 |
2000 | asiacrypt | A Note on Security Proofs in the Generic Model | 458-469 |
2000 | asiacrypt | Commital Deniable Proofs and Electronic Campaign Finance | 373-387 |
2000 | asiacrypt | Mix and Match: Secure Function Evaluation via Ciphertexts | 162-177 |
2000 | asiacrypt | Security of Signed ElGamal Encryption | 73-89 |
2000 | asiacrypt | Addition of ElGamal Plaintexts | 346-358 |
2000 | asiacrypt | Cryptanalysis of the TTM Cryptosystem | 44-57 |
2000 | asiacrypt | Improved Methods to Perform Threshold RSA | 359-372 |
2000 | asiacrypt | Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems | 429-442 |
2000 | asiacrypt | Zero-Knowledge and Code Obfuscation | 443-457 |
2000 | asiacrypt | Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders | 234-247 |
2000 | ches | Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies | 71-77 |
2000 | ches | A 12 Gbps DES Encryptor/Decryptor Core in an FPGA | 156-163 |
2000 | ches | Data Integrity in Hardware for Modular Arithmetic | 204-215 |
2000 | ches | Physical Security Devices for Computer Subsystems: A Survey of Attacks and Defences | 302-317 |
2000 | ches | Cryptographic Hardware and Embedded Systems - CHES 2000, Second International Workshop, Worcester, MA, USA, August 17-18, 2000, Proceedings | online |
2000 | ches | Montgomery Multiplier and Squarer in GF(2m) | 264-276 |
2000 | ches | Montgomery Exponentiation with no Final Subtractions: Improved Results | 293-301 |
2000 | ches | Software Implementation of Elliptic Curve Cryptography over Binary Fields | 1-24 |
2000 | ches | Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems | 93-108 |
2000 | ches | MiniPASS: Authentication and Digital Signatures in a Constrained Environment | 328-339 |
2000 | ches | Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor | 57-70 |
2000 | ches | Differential Power Analysis in the Presence of Hardware Countermeasures | 252-263 |
2000 | ches | On Boolean and Arithmetic Masking against Differential Power Analysis | 231-237 |
2000 | ches | Efficient Generation of Prime Numbers | 340-354 |
2000 | ches | A Comparative Study of Performance of AES Final Candidates Using FPGAs | 125-140 |
2000 | ches | A Design for Modular Exponentiation Coprocessor in Mobile Telecommunication Terminals | 216-228 |
2000 | ches | An Energy Efficient Reconfigurable Public-Key Cryptograhpy Processor Architecture | 175-190 |
2000 | ches | A 155 Mbps Triple-DES Network Encryptor | 164-174 |
2000 | ches | High-Speed RSA Hardware Based on Barret's Modular Reduction Method | 191-203 |
2000 | ches | Smartly Analyzing the Simplicity and the Power of Simple Power Analysis on Smartcards | 78-92 |
2000 | ches | Using Second-Order Power Analysis to Attack DPA Resistant Software | 238-251 |
2000 | ches | How to Explain Side-Channel Leakage to Your Kids | 229-230 |
2000 | ches | Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA | 25-40 |
2000 | ches | A High Performance Reconfigurable Elliptic Curve Processor for GF(2m) | 41-56 |
2000 | ches | A Dynamic FPGA Implementation of the Serpent Block Cipher | 141-155 |
2000 | ches | Software-Hardware Trade-Offs: Application to A5/1 Cryptanalysis | 318-327 |
2000 | ches | A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) | 277-292 |
2000 | ches | A Timing Attack against RSA with the Chinese Remainder Theorem | 109-124 |
2000 | crypto | Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications | online |
2000 | crypto | Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing | online |
2000 | crypto | The development of DES | |
2000 | crypto | The XTR Public Key System | online |
2000 | crypto | Efficient Non-malleable Commitment Schemes | online |
2000 | crypto | Privacy Preserving Data Mining | online |
2000 | crypto | Long-Lived Broadcast Encryption | online |
2000 | crypto | An Improved Pseudo-random Generator Based on Discrete Log | online |
2000 | crypto | Timed Commitments | online |
2000 | crypto | Linking Classical and Quantum Key Agreement: Is There ``Bound Information''? | online |
2000 | crypto | Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers | online |
2000 | crypto | Quantum Public-Key Cryptosystems | online |
2000 | crypto | CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions | online |
2000 | crypto | Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings | online |
2000 | crypto | Optimistic Fair Secure Computation | online |
2000 | crypto | Taming the Adversary | online |
2000 | crypto | Key Recovery and Forgery Attacks on the MacDES MAC Algorithm | online |
2000 | crypto | On the Exact Security of Full Domain Hash | online |
2000 | crypto | On the Round Security of Symmetric-Key Cryptographic Primitives | online |
2000 | crypto | Provably Secure Partially Blind Signatures | online |
2000 | crypto | A Note on the Round-Complexity of Concurrent Zero-Knowledge | online |
2000 | crypto | A Chosen-Ciphertext Attack against NTRU | online |
2000 | crypto | New Public-Key Cryptosystem Using Braid Groups | online |
2000 | crypto | Sequential Traitor Tracing | online |
2000 | crypto | Fast Correlation Attacks through Reconstruction of Linear Polynomials | online |
2000 | crypto | Nonlinearity Bounds and Constructions of Resilient Boolean Functions | online |
2000 | crypto | Improved Non-committing Encryption Schemes Based on a General Complexity Assumption | online |
2000 | crypto | L-collision Attacks against Randomized MACs | online |
2000 | crypto | A Practical and Provably Secure Coalition-Resistant Group Signature Scheme | online |
2000 | crypto | The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search | online |
2000 | crypto | New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack | online |
2000 | crypto | A Cryptographic Solution to a Game Theoretic Problem | online |
2000 | crypto | Parallel Reducibility for Information-Theoretically Secure Computation | online |
2000 | crypto | Weaknesses in the SL2(IFs2) Hashing Scheme | online |
2000 | crypto | Differential Fault Attacks on Elliptic Curve Cryptosystems | online |
2000 | eprint | On Security Preserving Reductions -- Revised Terminology | online |
2000 | eprint | A New Forward-Secure Digital Signature Scheme | online |
2000 | eprint | Implications of the Nontriviality of Entropy Approximation | online |
2000 | eprint | Combinatorial Properties of Frameproof and Traceability Codes | online |
2000 | eprint | On Resilient Boolean Functions with Maximal Possible Nonlinearity | online |
2000 | eprint | An Encryption Algorithm and Key-stream Generator for Chinese Text Messages by Character Internal Code Structure | online |
2000 | eprint | Public Electronic Contract Protocol | online |
2000 | eprint | Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes | online |
2000 | eprint | New Directions in Design of Resilient Boolean Functions | online |
2000 | eprint | The Security of Chaffing and Winnowing | online |
2000 | eprint | Tailored Key Encryption (TaKE) Tailoring a key for a given pair of plaintext/ciphertext | online |
2000 | eprint | Chosen Message Attack Against Goldreich-Goldwasser-Halevi's Signature Scheme from Crypto'97 | online |
2000 | eprint | Concurrent Zero-Knowledge in Poly-logarithmic Rounds | online |
2000 | eprint | Authenticated Key Exchange Secure Against Dictionary Attacks | online |
2000 | eprint | Identification Protocols Secure Against Reset Attacks | online |
2000 | eprint | Cryptanalysis of RSA with small prime difference | online |
2000 | eprint | Lower Bounds on the Efficiency of Generic Cryptographic Constructions | online |
2000 | eprint | Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP | online |
2000 | eprint | Threshold Cryptography Secure Against the Adaptive Adversary, Concurrently | online |
2000 | eprint | On the Security of Diffie--Hellman Bits | online |
2000 | eprint | An Efficient Identification Scheme Based on Permuted Patterns | online |
2000 | eprint | ACE: The Advanced Cryptographic Engine | online |
2000 | eprint | Security of Polynomial Transformations of the Diffie--Hellman Key | online |
2000 | eprint | Security of the Most Significant Bits of the Shamir Message Passing Scheme | online |
2000 | eprint | Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm | online |
2000 | eprint | Authentication and Key Agreement via Memorable Password | online |
2000 | eprint | Accountable Certificate Management using Undeniable Attestations | online |
2000 | eprint | An Information-Theoretic Model for Steganography | online |
2000 | eprint | Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications | online |
2000 | eprint | Secure Multiparty Computation of Approximations | online |
2000 | eprint | Forward Security in Threshold Signature Schemes | online |
2000 | eprint | Anonymous Fingerprinting with Direct Non-Repudiation | online |
2000 | eprint | The Complete Distribution of Linear Probabilities of MARS' s-box | online |
2000 | eprint | Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement using Cryptography | online |
2000 | eprint | Electronic Jury Voting Protocols | online |
2000 | eprint | Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation | online |
2000 | eprint | General Secure Multi-Party Computation from any Linear Secret Sharing Scheme | online |
2000 | eprint | On the Complexity of Verifiable Secret Sharing and Multi-Party Computation | online |
2000 | eprint | Encryption Modes with Almost Free Message Integrity | online |
2000 | eprint | Decimation Attack of Stream Ciphers | online |
2000 | eprint | On Symmetrically Private Information Retrieval | online |
2000 | eprint | Constructing Pseudo-Random Permutations with a Prescribed Structure | online |
2000 | eprint | Constructions and Bounds for Unconditionally Secure Commitment Schemes | online |
2000 | eprint | Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman | online |
2000 | eprint | Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions | online |
2000 | eprint | The Saturation Attack - a Bait for Twofish | online |
2000 | eprint | Highly Nonlinear Balanced Boolean Functions with very good Autocorrelation Property | online |
2000 | eprint | New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity | online |
2000 | eprint | Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions | online |
2000 | eprint | Spectral Analysis of High Order Correlation Immune Functions | online |
2000 | eprint | Reducing the Gate Count of Bitslice DES | online |
2000 | eprint | CRYPTANALYSIS OF THE A5/2 ALGORITHM | online |
2000 | eprint | A Construction of Resilient Functions with High Nonlinearity | online |
2000 | eprint | Correlation Immune Boolean Functions with Very High Nonlinearity | online |
2000 | eprint | Multiparty Computation from Threshold Homomorphic Encryption | online |
2000 | eprint | A Complete Problem for Statistical Zero Knowledge | online |
2000 | eprint | Session-Key Generation using Human Passwords Only | online |
2000 | eprint | Graph-Based Authentication of Digital Streams | online |
2000 | eprint | Essential Shannon Security with Keys Smaller Than the Encrypted Message | online |
2000 | eprint | OAEP Reconsidered | online |
2000 | eprint | RSA-OAEP is Secure under the RSA Assumption | online |
2000 | eprint | Non-Deforming Digital Watermarks | online |
2000 | eprint | Candidate One-Way Functions Based on Expander Graphs | online |
2000 | eprint | On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators | online |
2000 | eprint | How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes | online |
2000 | eprint | A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission | online |
2000 | eprint | Universally Composable Security: A New Paradigm for Cryptographic Protocols | online |
2000 | eprint | A Content Certified E-mail Protocol with a Public Mailbox | online |
2000 | eprint | New constructions of resilient Boolean functions with maximal nonlinearity | online |
2000 | eurocrypt | Minimal-Latency Secure Function Evaluation | online |
2000 | eurocrypt | Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation | online |
2000 | eurocrypt | Advanced Slide Attacks | online |
2000 | eurocrypt | The Sum of PRPs Is a Secure PRF | online |
2000 | eurocrypt | Noisy Polynomial Interpolation and Noisy Chinese Remaindering | online |
2000 | eurocrypt | Authenticated Key Exchange Secure against Dictionary Attacks | online |
2000 | eurocrypt | Cryptanalysis of Countermeasures Proposed for Repairing ISO 9796-1 | online |
2000 | eurocrypt | On the Security of 3GPP Networks | online |
2000 | eurocrypt | Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman | online |
2000 | eurocrypt | Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free | online |
2000 | eurocrypt | Security Aspects of Practical Quantum Cryptography | online |
2000 | eurocrypt | Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures | online |
2000 | eurocrypt | A NICE Cryptanalysis | online |
2000 | eurocrypt | A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme | online |
2000 | eurocrypt | Factorization of a 512-Bit RSA Modulus | online |
2000 | eurocrypt | New Attacks on PKCS#1 v1.5 Encryption | online |
2000 | eurocrypt | Confirmer Signature Schemes Secure against Adaptive Adversaries | online |
2000 | eurocrypt | Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme | online |
2000 | eurocrypt | Advances in Cryptology - EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000, Proceeding | online |
2000 | eurocrypt | Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations | online |
2000 | eurocrypt | Exposure-Resilient Functions and All-or-Nothing Transforms | online |
2000 | eurocrypt | General Secure Multi-party Computation from any Linear Secret-Sharing Scheme | online |
2000 | eurocrypt | Cox-Rower Architecture for Fast Parallel Montgomery Multiplication | online |
2000 | eurocrypt | Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions | online |
2000 | eurocrypt | Fair Encryption of RSA Keys | online |
2000 | eurocrypt | Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 | online |
2000 | eurocrypt | Efficient Receipt-Free Voting Based on Homomorphic Encryption | online |
2000 | eurocrypt | Computing Inverses over a Shared Secret Modulus | online |
2000 | eurocrypt | Single Database Private Information Retrieval Implies Oblivious Transfer | online |
2000 | eurocrypt | Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements | online |
2000 | eurocrypt | Efficient Proofs that a Committed Number Lies in an Interval | online |
2000 | eurocrypt | Efficient Concurrent Zero-Knowledge in the Auxiliary String Model | online |
2000 | eurocrypt | Practical Threshold Signatures | online |
2000 | eurocrypt | Using Hash Functions as a Hedge against Chosen Ciphertext Attack | online |
2000 | eurocrypt | A Composition Theorem for Universal One-Way Hash Functions | online |
2000 | eurocrypt | How to Break a Practical MIX and Design a New One | online |
2000 | eurocrypt | One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval | online |
2000 | eurocrypt | Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R) | online |
2000 | eurocrypt | Colossus and the German Lorenz Cipher - Code Breaking in WW II | online |
2000 | eurocrypt | Construction of Nonlinear Boolean Functions with Important Cryptographic Properties | online |
2000 | eurocrypt | An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves | online |
2000 | eurocrypt | Analysis and Optimization of the TWINKLE Factoring Device | online |
2000 | fse | A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers | 181-195 |
2000 | fse | Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation | 284-299 |
2000 | fse | Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent | 75-93 |
2000 | fse | Correlations in RC6 with a Reduced Number of Rounds | 94-108 |
2000 | fse | A Chosen-Plaintext Linear Attack on DES | 262-272 |
2000 | fse | Securing the AES Finalists Against Power Analysis Attacks | 150-164 |
2000 | fse | A Low-Complexity and High-Performance Algorithm for the Fast Correlation Attack | 196-212 |
2000 | fse | Stochastic Cryptanalysis of Crypton | 121-133 |
2000 | fse | Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family | 244-261 |
2000 | fse | Provable Security against Differential and Linear Cryptanalysis for the SPN Structure | 273-283 |
2000 | fse | Fast Software Encryption, 7th International Workshop, FSE 2000, New York, NY, USA, April 10-12, 2000, Proceedings | online |
2000 | fse | On the Pseudorandomness of the AES Finalists - RC6 and Serpent | 231-243 |
2000 | fse | Mercy: A Fast Large Block Cipher for Disk Sector Encryption | 49-63 |
2000 | fse | On the Interpolation Attacks on Block Ciphers | 109-120 |
2000 | fse | The Software-Oriented Stream Cipher SSC2 | 31-48 |
2000 | fse | Bitslice Ciphers and Power Analysis Attacks | 134-149 |
2000 | fse | Improved Cryptanalysis of Rijndael | 213-230 |
2000 | fse | Statistical Analysis of the Alleged RC4 Keystream Generator | 19-30 |
2000 | fse | Real Time Cryptanalysis of A5/1 on a PC | 1-18 |
2000 | fse | A Statistical Attack on RC6 | 64-74 |
2000 | fse | Efficient Methods for Generating MARS-Like S-Boxes | 300-314 |
2000 | fse | Ciphertext Only Reconstruction of Stream Ciphers Based on Combination Generators | 165-180 |
2000 | jofc | Stronger Security Proofs for RSA and Rabin Bits | 221-244 |
2000 | jofc | Secure Communication in Minimal Connectivity Models | 9-30 |
2000 | jofc | Robust and Efficient Sharing of RSA Functions | 273-300 |
2000 | jofc | RSA-Based Undeniable Signatures | 397-416 |
2000 | jofc | Preface | 1-7 |
2000 | jofc | Short Non-Interactive Cryptographic Proofs | 449-472 |
2000 | jofc | Fast Correlation Attacks on the Summation Generator | 245-262 |
2000 | jofc | Security and Composition of Multiparty Cryptographic Protocols | 143-202 |
2000 | jofc | Maintaining Authenticated Communication in the Presence of Break-Ins | 61-105 |
2000 | jofc | Player Simulation and General Adversary Structures in Perfect Multiparty Computation | 31-60 |
2000 | jofc | Randomness versus Fault-Tolerance | 107-142 |
2000 | jofc | On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping | 339-360 |
2000 | jofc | Computing Discrete Logarithms in Quadratic Orders | 473-492 |
2000 | jofc | A Detailed Analysis of SAFER K | 417-436 |
2000 | jofc | A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time | 263-272 |
2000 | jofc | Security Arguments for Digital Signatures and Blind Signatures | 361-396 |
2000 | jofc | Kangaroos, Monopoly and Discrete Logarithms | 437-447 |
2000 | jofc | Practical Aspects of Quantum Cryptographic Key Distribution | 207-220 |
2000 | jofc | Maximum Correlation Analysis of Nonlinear Combining Functions in Stream Ciphers | 301-314 |
2000 | jofc | CBC MAC for Real-Time Data Sources | 315-338 |
2000 | pkc | "Psyeudorandom Intermixing": A Tool for Shared Cryptography | 306-325 |
2000 | pkc | An Identification Scheme Based on Sparse Polynomials | 68-74 |
2000 | pkc | Efficient and Fresh Cerification | 342-353 |
2000 | pkc | Cryptographic Approaches to Provacy in Forensic DNA Databases | 373-390 |
2000 | pkc | Design Validations for Discrete Logarithm Based Signature Schemes | 276-292 |
2000 | pkc | Optimally Efficient Accountable Time-Stamping | 293-305 |
2000 | pkc | A Structured ElGamal-Type Multisignature Scheme | 466-483 |
2000 | pkc | An Efficient NICE-Schnorr-Type Signature Scheme | 14-27 |
2000 | pkc | Making Hash Functions From Block Ciphers Secure and Efficient by Using Convolutional Codes | 391-404 |
2000 | pkc | Efficient Implementation of Schoof's Algorithm in Case of Characteristic 2 | 210-222 |
2000 | pkc | Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions | 354-373 |
2000 | pkc | Selecting Cryptographic Key Sizes | 446-465 |
2000 | pkc | Fast Implementation of Elliptic Curve Arithmetic in GF(pn) | 405-421 |
2000 | pkc | A State-Based Model for Certificate Management Systems | 75-92 |
2000 | pkc | Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications | 238-257 |
2000 | pkc | Key Recovery in Third Generation Wireless Communication Systems | 223-237 |
2000 | pkc | Forward Secrecy and Its Application to Future Mobile Communications Security | 433-445 |
2000 | pkc | Identification of Bad Signatures in Batches | 28-45 |
2000 | pkc | The Composite Discrete Logarithm and Secure Authentication | 113-128 |
2000 | pkc | Chosen-Ciphertext Security for Any One-Way Cryptosystem | 129-146 |
2000 | pkc | Short Proofs of Knowledge for Factoring | 147-166 |
2000 | pkc | An Auction Protocol Which Hides Bids of Losers | 422-432 |
2000 | pkc | All-or-Nothing Transform and Remotely Keyed Encription Protocols | 178-195 |
2000 | pkc | A Practical and Secure-Fault-Tolerant Conferenc-Key Agreement Protocol | 1-13 |
2000 | pkc | Certificates of Recoverability with Scale Recovery Agent Security | 258-275 |
2000 | pkc | Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms | 167-177 |
2000 | pkc | Security of Public Key Certificate Based Authentication Protocols | 196-209 |
2000 | pkc | RSA-Based Auto-recoverable Cryptosystems | 326-341 |
2000 | pkc | Public Key Cryptography, Third International Workshop on Practice and Theory in Public Key Cryptography, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000, Proceedings | online |
2000 | pkc | Some Remarks on a Fair Exchange Protocol | 46-57 |
2000 | pkc | Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence | 93-112 |
2000 | pkc | Gaudry's Variant against Cab Curves | 58-67 |