year |
venue |
title |
pages |
2009 | asiacrypt | Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings | online |
2009 | asiacrypt | Zero Knowledge in the Random Oracle Model, Revisited | online |
2009 | asiacrypt | Secure Two-Party Computation Is Practical | online |
2009 | asiacrypt | Secure Multi-party Computation Minimizing Online Rounds | online |
2009 | asiacrypt | Hedged Public-Key Encryption: How to Protect against Bad Randomness | online |
2009 | asiacrypt | Foundations of Non-malleable Hash and One-Way Functions | online |
2009 | asiacrypt | Cryptanalysis of the Square Cryptosystems | online |
2009 | asiacrypt | Security Notions and Generic Constructions for Client Puzzles | online |
2009 | asiacrypt | On the Power of Two-Party Quantum Cryptography | 70-87 |
2009 | asiacrypt | Quantum-Secure Coin-Flipping and Applications | online |
2009 | asiacrypt | The Key-Dependent Attack on Block Ciphers | online |
2009 | asiacrypt | A Framework for Universally Composable Non-committing Blind Signatures | online |
2009 | asiacrypt | Hierarchical Predicate Encryption for Inner-Products | online |
2009 | asiacrypt | Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices | online |
2009 | asiacrypt | Group Encryption: Non-interactive Realization in the Standard Model | online |
2009 | asiacrypt | Improved Cryptanalysis of Skein | online |
2009 | asiacrypt | MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners | online |
2009 | asiacrypt | Rebound Attack on the Full Lane Compression Function | online |
2009 | asiacrypt | Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions | online |
2009 | asiacrypt | Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures | online |
2009 | asiacrypt | Related-Key Cryptanalysis of the Full AES-192 and AES-256 | online |
2009 | asiacrypt | Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? | online |
2009 | asiacrypt | Proofs of Storage from Homomorphic Identification Protocols | online |
2009 | asiacrypt | PSS Is Secure against Random Fault Attacks | online |
2009 | asiacrypt | The Intel AES Instructions Set and the SHA-3 Candidates | online |
2009 | asiacrypt | Improved Generic Algorithms for 3-Collisions | online |
2009 | asiacrypt | Cache-Timing Template Attacks | online |
2009 | asiacrypt | A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical | online |
2009 | asiacrypt | Security Bounds for the Design of Code-Based Cryptosystems | online |
2009 | asiacrypt | Preimages for Step-Reduced SHA-2 | online |
2009 | asiacrypt | Rebound Distinguishers: Results on the Full Whirlpool Compression Function | online |
2009 | asiacrypt | Simple Adaptive Oblivious Transfer without Random Oracle | online |
2009 | asiacrypt | Signature Schemes with Bounded Leakage Resilience | online |
2009 | asiacrypt | Improved Non-committing Encryption with Applications to Adaptively Secure Protocols | online |
2009 | asiacrypt | Efficient Public Key Encryption Based on Ideal Lattices | online |
2009 | asiacrypt | On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations | online |
2009 | asiacrypt | Linearization Framework for Collision Attacks: Application to CubeHash and MD6 | online |
2009 | asiacrypt | How to Confirm Cryptosystems Security: The Original Merkle-Damgård Is Still Alive! | 382-398 |
2009 | asiacrypt | On the Analysis of Cryptographic Assumptions in the Generic Ring Model | online |
2009 | asiacrypt | Factoring pq2 with Quadratic Forms: Nice Cryptanalyses | online |
2009 | asiacrypt | Non-malleable Statistically Hiding Commitment from Any One-Way Function | online |
2009 | asiacrypt | Cascade Encryption Revisited | online |
2009 | ches | Cryptographic Hardware and Embedded Systems - CHES 2009, 11th International Workshop, Lausanne, Switzerland, September 6-9, 2009, Proceedings | online |
2009 | ches | Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers | online |
2009 | ches | Differential Fault Analysis on DES Middle Rounds | online |
2009 | ches | Crypto Engineering: Some History and Some Case Studies | online |
2009 | ches | A Design Methodology for a DPA-Resistant Cryptographic LSI with RSL Techniques | online |
2009 | ches | Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security | online |
2009 | ches | Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers | online |
2009 | ches | CDs Have Fingerprints Too | online |
2009 | ches | A New Side-Channel Attack on RSA Prime Generation | online |
2009 | ches | Accelerating AES with Vector Permute Instructions | online |
2009 | ches | Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs | online |
2009 | ches | Physical Unclonable Functions and Secure Processors | online |
2009 | ches | Practical Electromagnetic Template Attack on HMAC | online |
2009 | ches | Differential Cluster Analysis | online |
2009 | ches | MicroEliece: McEliece for Embedded Devices | online |
2009 | ches | Mutual Information Analysis: How, When and Why? | online |
2009 | ches | SSE Implementation of Multivariate PKCs on Modern x86 CPUs | online |
2009 | ches | MERO: A Statistical Approach for Hardware Trojan Detection | online |
2009 | ches | First-Order Side-Channel Attacks on the Permutation Tables Countermeasure | online |
2009 | ches | Faster -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves | online |
2009 | ches | Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA | online |
2009 | ches | A Design Flow and Evaluation Framework for DPA-Resistant Instruction Set Extensions | online |
2009 | ches | Trojan Side-Channels: Lightweight Hardware Trojans through Side-Channel Engineering | online |
2009 | ches | Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves | online |
2009 | ches | On Tamper-Resistance from a Theoretical Viewpoint | online |
2009 | ches | The Frequency Injection Attack on Ring-Oscillator-Based True Random Number Generators | online |
2009 | ches | Fault Attacks on RSA Signatures with Partially Unknown Messages | online |
2009 | ches | Known-Plaintext-Only Attack on RSA-CRT with Montgomery Multiplication | online |
2009 | ches | Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases | online |
2009 | ches | Faster and Timing-Attack Resistant AES-GCM | online |
2009 | ches | KATAN and KTANTAN - A Family of Small and Efficient Hardware-Oriented Block Ciphers | online |
2009 | ches | An Efficient Method for Random Delay Generation in Embedded Software | online |
2009 | ches | The State-of-the-Art in IC Reverse Engineering | online |
2009 | crypto | Alice and Bob Go To Washington: A Cryptographic Theory of Politics and Policy | |
2009 | crypto | Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field | online |
2009 | crypto | Abstraction in Cryptography | online |
2009 | crypto | The Round Complexity of Verifiable Secret Sharing Revisited | online |
2009 | crypto | Smooth Projective Hashing for Conditionally Extractable Commitments | online |
2009 | crypto | How to Encipher Messages on a Small Domain | 286-302 |
2009 | crypto | Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model | online |
2009 | crypto | Computational Differential Privacy | online |
2009 | crypto | How Risky Is the Random-Oracle Model? | online |
2009 | crypto | Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle | online |
2009 | crypto | Short and Stateless Signatures from the RSA Assumption | online |
2009 | crypto | Reconstructing RSA Private Keys from Random Key Bits | online |
2009 | crypto | New Birthday Attacks on Some MACs Based on Block Ciphers | online |
2009 | crypto | On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem | online |
2009 | crypto | Batch Binary Edwards | online |
2009 | crypto | On the Composition of Public-Coin Zero-Knowledge Protocols | online |
2009 | crypto | Randomizable Proofs and Delegatable Anonymous Credentials | online |
2009 | crypto | Improving the Security of Quantum Protocols via Commit-and-Open | online |
2009 | crypto | Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions | online |
2009 | crypto | Probabilistically Checkable Arguments | online |
2009 | crypto | Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate | online |
2009 | crypto | Solving Hidden Number Problem with One Bit Oracle and Advice | online |
2009 | crypto | Public-Key Cryptosystems Resilient to Key Leakage | online |
2009 | crypto | Computational Indistinguishability Amplification: Tight Product Theorems for System Composition | online |
2009 | crypto | Distinguisher and Related-Key Attack on the Full AES-256 | online |
2009 | crypto | The Group of Signed Quadratic Residues and Applications | online |
2009 | crypto | Cryptanalysis of C2 | online |
2009 | crypto | Private Mutual Authentication and Conditional Oblivious Transfer | online |
2009 | crypto | Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures | online |
2009 | crypto | Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 | online |
2009 | crypto | Linear Algebra with Sub-linear Zero-Knowledge Arguments | online |
2009 | crypto | Privacy-Enhancing Auctions Using Rational Cryptography | online |
2009 | crypto | On the Amortized Complexity of Zero-Knowledge Protocols | online |
2009 | crypto | Message Authentication Codes from Unpredictable Block Ciphers | online |
2009 | crypto | How to Hash into Elliptic Curves | online |
2009 | crypto | Position Based Cryptography | online |
2009 | crypto | Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems | online |
2009 | crypto | Collusion-Free Multiparty Computation in the Mediated Model | online |
2009 | crypto | Utility Dependence in Correct and Fair Rational Secret Sharing | online |
2009 | crypto | Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer | online |
2009 | crypto | Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings | online |
2009 | eprint | Huge 2ndpreimages and collisions of khichidi-1 | online |
2009 | eprint | Enhanced Target Collision Resistant Hash Functions Revisited | online |
2009 | eprint | Encryption Schemes Secure under Selective Opening Attack | online |
2009 | eprint | Computing the endomorphism ring of an ordinary elliptic curve over a finite field | online |
2009 | eprint | A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem | online |
2009 | eprint | Cascade Encryption Revisited | online |
2009 | eprint | How to Prove the Security of Practical Cryptosystems with Merkle-Damg{\aa}rd Hashing by Adopting Indifferentiability | online |
2009 | eprint | Security Enhancement of Various MPKCs by 2-layer Nonlinear Piece In Hand Method | online |
2009 | eprint | Adaptive Preimage Resistance and Permutation-based Hash Functions | online |
2009 | eprint | A note on the security of MST3 | online |
2009 | eprint | A general framework for computational soundness proofs - or - The computational soundness of the applied pi-calculus | online |
2009 | eprint | Re-randomizable Encryption implies Selective Opening Security | online |
2009 | eprint | Short Redactable Signatures Using Random Trees | online |
2009 | eprint | Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme | online |
2009 | eprint | On the Portability of Generalized Schnorr Proofs | online |
2009 | eprint | A note on Agrawal conjecture | online |
2009 | eprint | UC-Secure Source Routing Protocol | online |
2009 | eprint | On Approximating Addition by Exclusive OR | online |
2009 | eprint | Anonymity in Shared Symmetric Key Primitives | online |
2009 | eprint | A Fast Implementation of $\eta_T$ Pairing in Characteristic Three on Intel Core 2 Duo Processor | online |
2009 | eprint | Communication-Efficient Private Protocols for Longest Common Subsequence | online |
2009 | eprint | Multi-authority attribute based encryption with honest-but-curious central authority | online |
2009 | eprint | On the Lower Bounds of the Second Order Nonlinearity of some Boolean Functions | online |
2009 | eprint | Point Compression for Koblitz Elliptic Curves | online |
2009 | eprint | Correctness of Li Generalization of RSA Cryptosystem | online |
2009 | eprint | Davies-Meyer Merkle-Damg{\aa}rd Revisited:\\Variants of Indifferentiability and Random Oracles | online |
2009 | eprint | CCZ-equivalence and Boolean functions | online |
2009 | eprint | Attacking Cryptographic Schemes Based on "Perturbation Polynomials" | online |
2009 | eprint | Comparing Two Pairing-Based Aggregate Signature Schemes | online |
2009 | eprint | Applying Time-Memory-Data Trade-Off to Meet-in-the-Middle Attack | online |
2009 | eprint | On Second-Order Fault Analysis Resistance for CRT-RSA Implementations | online |
2009 | eprint | Common Modulus Attacks on Small Private Exponent RSA and Some Fast Variants (in Practice) | online |
2009 | eprint | Combining Computational and Information-Theoretic Security in Multi-Party Computation | online |
2009 | eprint | Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1 | online |
2009 | eprint | Key Insulation and Intrusion Resilience Over a Public Channel | online |
2009 | eprint | On the Security of Tandem-DM | online |
2009 | eprint | Automatic Approach of Provable Security and its Application for OAEP+ | online |
2009 | eprint | A Very Compact "Perfectly Masked" S-Box for AES (corrected) | online |
2009 | eprint | On Generalization of Cheon's Algorithm | online |
2009 | eprint | Traceability Codes | online |
2009 | eprint | Secret sharing on trees: problem solved | online |
2009 | eprint | Realizing Hash-and-Sign Signatures under Standard Assumptions | online |
2009 | eprint | Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries | online |
2009 | eprint | A Brief History of Provably-Secure Public-Key Encryption | online |
2009 | eprint | Polynomial Runtime and Composability | online |
2009 | eprint | Fast elliptic-curve cryptography on the Cell Broadband Engine | online |
2009 | eprint | Implementing cryptographic pairings: a magma tutorial | online |
2009 | eprint | Anonymous signature scheme | online |
2009 | eprint | Identification of Multiple Invalid Signatures in Pairing-based Batched Signatures | online |
2009 | eprint | Enhanced Privacy ID from Bilinear Pairing | online |
2009 | eprint | Reducing RFID Reader Load with the Meet-in-the-Middle Strategy | online |
2009 | eprint | A Single Initialization Server for Multi-Party Cryptography | online |
2009 | eprint | An efficient fuzzy extractor for limited noise | online |
2009 | eprint | Trade-Off Between Key Size and Efficiency in Universal Hashing Using Polynomials | online |
2009 | eprint | Separating two roles of hashing in one-way message authentication | online |
2009 | eprint | On Algebraic Relations of Serpent S-Boxes | online |
2009 | eprint | Nofish - A new stream cipher | online |
2009 | eprint | The Brezing-Weng-Freeman Method for Certain Genus two Hyperelliptic Curves | online |
2009 | eprint | Comparing With RSA | online |
2009 | eprint | On the Data Complexity of Statistical Attacks Against Block Ciphers (full version) | online |
2009 | eprint | Huge Multicollisions and Multipreimages of Hash Functions BLENDER-n | online |
2009 | eprint | Key Predistribution Techniques for Grid-Based Wireless Sensor Networks | online |
2009 | eprint | Thermocommunication | online |
2009 | eprint | Attacks on the DECT authentication mechanisms | online |
2009 | eprint | On fractional correlation immunity of majority functions | online |
2009 | eprint | Foundations of Non-Malleable Hash and One-Way Functions | online |
2009 | eprint | 1024 - A High Security Software Oriented Block Cipher | online |
2009 | eprint | ID-GC: An Efficient Identity-based Group Key Management Scheme | online |
2009 | eprint | Knapsack Cryptosystem on Elliptic Curves | online |
2009 | eprint | Avoid Mask Re-use in Masked Galois Multipliers | online |
2009 | eprint | Ensuring Data Storage Security in Cloud Computing | online |
2009 | eprint | Collision Attack on NaSHA-384/512 | online |
2009 | eprint | Deterministic Polynomial-Time Equivalence of Computing the CRT-RSA Secret Keys and Factoring | online |
2009 | eprint | Cryptanalysis of Ring Signature and Ring Signcryption Schemes | online |
2009 | eprint | Constructions of Truly Practical Secure Protocols using Standard Smartcards | online |
2009 | eprint | Universally Composable Symmetric Encryption | online |
2009 | eprint | Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves | online |
2009 | eprint | Framework for Analyzing Optimistic Fair Exchange with Distributed Arbiters | online |
2009 | eprint | Computational Oblivious Transfer and Interactive Hashing | online |
2009 | eprint | From Dolev-Yao to Strong Adaptive Corruption: Analyzing Security in the Presence of Compromising Adversaries | online |
2009 | eprint | Cube Attacks on Trivium | online |
2009 | eprint | On a Conditional Collision Attack on NaSHA-512 | online |
2009 | eprint | Image Encryption by Pixel Property Separation | online |
2009 | eprint | Adaptively Secure Two-Party Computation with Erasures | online |
2009 | eprint | A Provably Secure And Efficient Countermeasure Against Timing Attacks | online |
2009 | eprint | Extensions of the Cube Attack | online |
2009 | eprint | Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Standard Basis | online |
2009 | eprint | Overview of Turbo-Code Reconstruction Techniques | online |
2009 | eprint | Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems | online |
2009 | eprint | On CCZ-equivalence and its use in secondary constructions of bent functions | online |
2009 | eprint | Un-Trusted-HB: Security Vulnerabilities of Trusted-HB | online |
2009 | eprint | Construction of large families of pseudorandom subsets using elliptic curves | online |
2009 | eprint | On Stateless Schemes for Message Authentication Using Pseudorandom Functions | online |
2009 | eprint | Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication | online |
2009 | eprint | A Step Towards QC Blind Signatures | online |
2009 | eprint | On the impossibility of graph secret sharing | online |
2009 | eprint | Proofs of Retrievability via Hardness Amplification | online |
2009 | eprint | On the Security of Iterated Hashing based on Forgery-resistant Compression Functions | online |
2009 | eprint | New commutative semifields defined by PN multinomials | online |
2009 | eprint | Impossible Differential Cryptanalysis of Pelican, MT-MAC-AES and PC-MAC-AES | online |
2009 | eprint | NESHA-256, NEw 256-bit Secure Hash Algorithm | online |
2009 | eprint | Security of Verifiably Encrypted Signatures | online |
2009 | eprint | Homomorphic Trapdoor Commitments to Group Elements | online |
2009 | eprint | The Case for Quantum Key Distribution | online |
2009 | eurocrypt | Practical Chosen Ciphertext Secure Encryption from Factoring | 313-332 |
2009 | eurocrypt | Key Agreement from Close Secrets over Unsecured Channels | 206-223 |
2009 | eurocrypt | Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields | 536-553 |
2009 | eurocrypt | Verifiable Random Functions from Identity-Based Key Encapsulation | 554-571 |
2009 | eurocrypt | Double-Base Number System for Multi-scalar Multiplications | 502-517 |
2009 | eurocrypt | Cube Attacks on Tweakable Black Box Polynomials | 278-299 |
2009 | eurocrypt | A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks | 443-461 |
2009 | eurocrypt | Optimal Randomness Extraction from a Diffie-Hellman Element | 572-589 |
2009 | eurocrypt | Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening | 1-35 |
2009 | eurocrypt | Practice-Oriented Provable-Security and the Social Construction of Cryptography | |
2009 | eurocrypt | On the Security Loss in Cryptographic Reductions | 72-87 |
2009 | eurocrypt | A Leakage-Resilient Mode of Operation | 462-482 |
2009 | eurocrypt | Cryptography without (Hardly Any) Secrets ? | 369-370 |
2009 | eurocrypt | Order-Preserving Symmetric Encryption | 224-241 |
2009 | eurocrypt | Cryptanalysis of MDC-2 | 106-120 |
2009 | eurocrypt | ECM on Graphics Cards | 483-501 |
2009 | eurocrypt | Realizing Hash-and-Sign Signatures under Standard Assumptions | 333-350 |
2009 | eurocrypt | Resettably Secure Computation | 54-71 |
2009 | eurocrypt | Asymmetric Group Key Agreement | 153-170 |
2009 | eurocrypt | Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts) | 171-188 |
2009 | eurocrypt | Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC | 121-133 |
2009 | eurocrypt | On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis | 260-277 |
2009 | eurocrypt | Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves | 518-535 |
2009 | eurocrypt | Finding Preimages in Full MD5 Faster Than Exhaustive Search | 134-152 |
2009 | eurocrypt | Breaking RSA Generically Is Equivalent to Factoring | 36-53 |
2009 | eurocrypt | On the Security of Padding-Based Encryption Schemes - or - Why We Cannot Prove OAEP Secure in the Standard Model | 389-406 |
2009 | eurocrypt | Smashing SQUASH-0 | online |
2009 | eurocrypt | Salvaging Merkle-Damgård for Practical Applications | 371-388 |
2009 | eurocrypt | Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme | 407-424 |
2009 | eurocrypt | A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks | 351-368 |
2009 | eurocrypt | A New Randomness Extraction Paradigm for Hybrid Encryption | 590-609 |
2009 | eurocrypt | On the Portability of Generalized Schnorr Proofs | 425-442 |
2009 | eurocrypt | A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier | 242-259 |
2009 | eurocrypt | Traitors Collaborating in Public: Pirates 2.0 | 189-205 |
2009 | eurocrypt | On Randomizing Hash Functions to Strengthen the Security of Digital Signatures | 88-105 |
2009 | fse | Looking back at the eSTREAM Project | |
2009 | fse | Fast Software Encryption, 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers | online |
2009 | fse | Key Collisions of the RC4 Stream Cipher | 38-50 |
2009 | fse | Fast and Secure CBC-Type MAC Algorithms | 375-393 |
2009 | fse | Meet-in-the-Middle Attacks on SHA-3 Candidates | 228-245 |
2009 | fse | Cryptanalysis of RadioGatún | 122-138 |
2009 | fse | New Cryptanalysis of Block Ciphers with Low Algebraic Degree | 180-192 |
2009 | fse | Algebraic Techniques in Differential Cryptanalysis | 193-208 |
2009 | fse | MAC Reforgeability | 345-362 |
2009 | fse | Revisiting the IDEA Philosophy | 277-295 |
2009 | fse | Practical Collisions for EnRUPT | 246-259 |
2009 | fse | Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 | 104-121 |
2009 | fse | Intel's New AES Instructions for Enhanced Performance and Security | 51-66 |
2009 | fse | On the Security of Tandem-DM | 84-103 |
2009 | fse | HBS: A Single-Key Mode of Operation for Deterministic Authenticated Encryption | 394-415 |
2009 | fse | Multidimensional Extension of Matsui's Algorithm 2 | 209-227 |
2009 | fse | An Efficient State Recovery Attack on X-FCSR-256 | 23-37 |
2009 | fse | Beyond-Birthday-Bound Security Based on Tweakable Block Cipher | 308-326 |
2009 | fse | The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl | 260-276 |
2009 | fse | New Distinguishing Attack on MAC Using Secret-Prefix Method | 363-374 |
2009 | fse | Enhanced Target Collision Resistant Hash Functions Revisited | 327-344 |
2009 | fse | Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium | 1-22 |
2009 | fse | Preimage Attacks on Reduced Tiger and SHA-2 | 139-155 |
2009 | fse | Blockcipher-Based Hashing Revisited | 67-83 |
2009 | fse | Cryptanalysis of the LAKE Hash Family | 156-179 |
2009 | fse | Cryptanalysis of the ISDB Scrambling Algorithm (MULTI2) | 296-307 |
2009 | jofc | Security Proofs for Identity-Based Identification and Signature Schemes | 1-61 |
2009 | jofc | A Public Key Cryptosystem Based on Non-abelian Finite Groups | 62-74 |
2009 | jofc | Reducing Complexity Assumptions for Statistically-Hiding Commitment | 283-310 |
2009 | jofc | Non-interactive Timestamping in the Bounded-Storage Model | 189-226 |
2009 | jofc | A Proof of Security of Yao's Protocol for Two-Party Computation | 161-188 |
2009 | jofc | Chernoff-Type Direct Product Theorems | 75-92 |
2009 | jofc | Using Abelian Varieties to Improve Pairing-Based Cryptography | 330-364 |
2009 | jofc | Cryptographic Hash Functions from Expander Graphs | 93-113 |
2009 | jofc | Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures | 139-160 |
2009 | jofc | Multipartite Secret Sharing by Bivariate Interpolation | 227-258 |
2009 | jofc | Upper and Lower Bounds on Black-Box Steganography | 365-394 |
2009 | jofc | Ring Signatures: Stronger Definitions, and Constructions without Random Oracles | 114-138 |
2009 | jofc | General Composition and Universal Composability in Secure Multiparty Computation | 395-428 |
2009 | jofc | Constructive and Destructive Use of Compilers in Elliptic Curve Cryptography | 259-281 |
2009 | jofc | On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions | 311-329 |
2009 | jofc | Efficient Non-malleable Commitment Schemes | 530-571 |
2009 | jofc | Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves, | 505-529 |
2009 | jofc | The Twin Diffie-Hellman Problem and Applications | 470-504 |
2009 | jofc | New Approaches for Deniable Authentication | 572-615 |
2009 | jofc | Cryptography with Constant Input Locality | 429-469 |
2009 | pkc | Public Key Cryptography - PKC 2009, 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings | online |
2009 | pkc | Distributed Public-Key Cryptography from Weak Secrets | online |
2009 | pkc | Compact CCA-Secure Encryption for Messages of Arbitrary Length | online |
2009 | pkc | An Algebraic Surface Cryptosystem | online |
2009 | pkc | A New Lattice Construction for Partial Key Exposure Attack for RSA | online |
2009 | pkc | Signing a Linear Subspace: Signature Schemes for Network Coding | online |
2009 | pkc | Security of Sanitizable Signatures Revisited | online |
2009 | pkc | Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data | online |
2009 | pkc | An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials | online |
2009 | pkc | Removing Escrow from Identity-Based Encryption | online |
2009 | pkc | Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials | online |
2009 | pkc | Asynchronous Multiparty Computation: Theory and Implementation | online |
2009 | pkc | On the Theory and Practice of Personal Digital Signatures | online |
2009 | pkc | Security of Blind Signatures under Aborts | online |
2009 | pkc | Multi-Party Computation with Omnipresent Adversary | online |
2009 | pkc | Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols | online |
2009 | pkc | A Practical Key Recovery Attack on Basic TCHo | online |
2009 | pkc | Verifiable Rotation of Homomorphic Encryptions | online |
2009 | pkc | Improving the Boneh-Franklin Traitor Tracing Scheme | online |
2009 | pkc | Zero-Knowledge Proofs with Witness Elimination | 124-138 |
2009 | pkc | Subset-Restricted Random Walks for Pollard rho Method on Fpm | online |
2009 | pkc | Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys | online |
2009 | pkc | Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication | online |
2009 | pkc | Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures | 337-356 |
2009 | pkc | Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint | online |
2009 | pkc | The Security of All Bits Using List Decoding | online |
2009 | pkc | Revocable Group Signature Schemes with Constant Costs for Signing and Verifying | online |
2009 | pkc | Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts | online |
2009 | pkc | CCA-Secure Proxy Re-encryption without Pairings | online |
2009 | pkc | From Signatures to Anonymous Credentials and Anonymous Delegation | |
2009 | pkc | A New Paradigm for Secure Protocols | |
2009 | tcc | Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings | online |
2009 | tcc | LEGO for Two-Party Secure Computation | online |
2009 | tcc | Authenticated Adversarial Routing | online |
2009 | tcc | Universally Composable Multiparty Computation with Partially Isolated Parties | online |
2009 | tcc | Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation | online |
2009 | tcc | Simulation-Based Concurrent Non-malleable Commitments and Decommitments | online |
2009 | tcc | Secure Arithmetic Computation with No Honest Majority | online |
2009 | tcc | Some Recent Progress in Lattice-Based Cryptography | online |
2009 | tcc | How Efficient Can Memory Checking Be? | online |
2009 | tcc | Composability and On-Line Deniability of Authentication | online |
2009 | tcc | Oblivious Transfer from Weak Noisy Channels | online |
2009 | tcc | Towards a Theory of Extractable Functions | online |
2009 | tcc | Composing Quantum Protocols in a Classical Environment | online |
2009 | tcc | An Optimally Fair Coin Toss | online |
2009 | tcc | Simultaneous Hardcore Bits and Cryptography against Memory Attacks | online |
2009 | tcc | Non-malleable Obfuscation | online |
2009 | tcc | Fairness with an Honest Minority and a Rational Majority | online |
2009 | tcc | On the (Im)Possibility of Key Dependent Encryption | online |
2009 | tcc | Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security | online |
2009 | tcc | Hierarchical Identity Based Encryption with Polynomially Many Levels | online |
2009 | tcc | Secret Sharing and Non-Shannon Information Inequalities | online |
2009 | tcc | Weak Verifiable Random Functions | online |
2009 | tcc | Security Amplification for InteractiveCryptographic Primitives | online |
2009 | tcc | Predicate Privacy in Encryption Systems | online |
2009 | tcc | Purely Rational Secret Sharing (Extended Abstract) | online |
2009 | tcc | On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols | online |
2009 | tcc | Proofs of Retrievability via Hardness Amplification | online |
2009 | tcc | Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer | online |
2009 | tcc | Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection | online |
2009 | tcc | Simple, Black-Box Constructions of Adaptively Secure Protocols | online |
2009 | tcc | Black-Box Constructions of Two-Party Protocols from One-Way Functions | online |
2009 | tcc | Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms | online |
2009 | tcc | Complete Fairness in Multi-party Computation without an Honest Majority | online |
2009 | tcc | Realistic Failures in Secure Multi-party Computation | online |
2009 | tcc | The Differential Privacy Frontier (Extended Abstract) | online |
2009 | tcc | Chosen-Ciphertext Security via Correlated Products | online |