| year |
venue |
title |
pages |
| 2012 | ches | Cryptographic Hardware and Embedded Systems - CHES 2012 - 14th International Workshop, Leuven, Belgium, September 9-12, 2012. Proceedings | |
| 2012 | ches | Towards One Cycle per Bit Asymmetric Encryption: Code-Based Cryptography on Reconfigurable Hardware | 340-355 |
| 2012 | ches | Practical Security Analysis of PUF-Based Two-Player Protocols | 251-267 |
| 2012 | ches | A Statistical Model for DPA with Novel Algorithmic Confusion Analysis | 233-250 |
| 2012 | ches | Selecting Time Samples for Multivariate DPA Attacks | 155-174 |
| 2012 | ches | Simple Photonic Emission Analysis of AES - Photonic Side Channel Analysis for the Rest of Us | 41-57 |
| 2012 | ches | Towards Green Cryptography: A Comparison of Lightweight Ciphers from the Energy Viewpoint | 390-407 |
| 2012 | ches | An Efficient Countermeasure against Correlation Power-Analysis Attacks with Randomized Montgomery Operations for DF-ECC Processor | 548-564 |
| 2012 | ches | On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes | 512-529 |
| 2012 | ches | Efficient and Provably Secure Methods for Switching from Arithmetic to Boolean Masking | 107-121 |
| 2012 | ches | Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs | 494-511 |
| 2012 | ches | Solving Quadratic Equations with XL on Parallel Architectures | 356-373 |
| 2012 | ches | Side Channel Attack to Actual Cryptanalysis: Breaking CRT-RSA with Low Weight Decryption Exponents | 476-493 |
| 2012 | ches | NEON Crypto | 320-339 |
| 2012 | ches | Efficient Implementations of MQPKS on Constrained Devices | 374-389 |
| 2012 | ches | Practical Leakage-Resilient Symmetric Cryptography | 213-232 |
| 2012 | ches | Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes | 76-91 |
| 2012 | ches | Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems | 530-547 |
| 2012 | ches | Low-Latency Encryption - Is "Lightweight = Light + Wait"? | 426-446 |
| 2012 | ches | Breakthrough Silicon Scanning Discovers Backdoor in Military Chip | 23-40 |
| 2012 | ches | Attacking RSA-CRT Signatures with Faults on Montgomery Multiplication | 447-462 |
| 2012 | ches | 3D Hardware Canaries | 1-22 |
| 2012 | ches | How Far Should Theory Be from Practice? - Evaluation of a Countermeasure | 92-106 |
| 2012 | ches | Compiler Assisted Masking | 58-75 |
| 2012 | ches | Soft Decision Error Correction for Compact Memory-Based PUFs Using a Single Enrollment | 268-282 |
| 2012 | ches | Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA | 463-475 |
| 2012 | ches | Unified and Optimized Linear Collision Attacks and Their Application in a Non-profiled Setting | 175-192 |
| 2012 | ches | PUFKY: A Fully Functional PUF-Based Cryptographic Key Generator | 302-319 |
| 2012 | ches | A Differential Fault Attack on the Grain Family of Stream Ciphers | 122-139 |
| 2012 | ches | Towards Super-Exponential Side-Channel Security with Efficient Leakage-Resilient PRFs | 193-212 |
| 2012 | ches | PUFs: Myth, Fact or Busted? A Security Evaluation of Physically Unclonable Functions (PUFs) Cast in Silicon | 283-301 |
| 2012 | ches | Lightweight Cryptography for the Cloud: Exploit the Power of Bitslice Implementation | 408-425 |
| 2012 | ches | Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model | 140-154 |
| 2012 | crypto | Homomorphic Evaluation of the AES Circuit | 850-867 |
| 2012 | crypto | Differential Privacy with Imperfect Randomness | 497-516 |
| 2012 | crypto | Securing Circuits against Constant-Rate Tampering | 533-551 |
| 2012 | crypto | New Preimage Attacks against Reduced SHA-1 | 367-383 |
| 2012 | crypto | Must You Know the Code of f to Securely Compute f? | 87-104 |
| 2012 | crypto | On the Distribution of Linear Biases: Three Instructive Examples | 50-67 |
| 2012 | crypto | Tweakable Blockciphers with Beyond Birthday-Bound Security | 14-30 |
| 2012 | crypto | Secret Sharing Schemes for Very Dense Graphs | 144-161 |
| 2012 | crypto | Black-Box Constructions of Composable Protocols without Set-Up | 461-478 |
| 2012 | crypto | The End of Crypto | 86 |
| 2012 | crypto | Group Signatures with Almost-for-Free Revocation | 571-589 |
| 2012 | crypto | Crowd-Blending Privacy | 479-496 |
| 2012 | crypto | How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware | 552-569 |
| 2012 | crypto | Tamper and Leakage Resilience in the Split-State Model | 517-532 |
| 2012 | crypto | Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority | 663-680 |
| 2012 | crypto | Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems | 719-740 |
| 2012 | crypto | New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation | 443-460 |
| 2012 | crypto | Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings | |
| 2012 | crypto | Public Keys | 626-642 |
| 2012 | crypto | Hash Functions Based on Three Permutations: A Generic Security Analysis | 330-347 |
| 2012 | crypto | Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs | 68-85 |
| 2012 | crypto | Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption | 199-217 |
| 2012 | crypto | A New Approach to Practical Active-Secure Two-Party Computation | 681-700 |
| 2012 | crypto | Semantic Security for the Wiretap Channel | 294-311 |
| 2012 | crypto | On the Security of TLS-DHE in the Standard Model | 273-293 |
| 2012 | crypto | Universal Composability from Essentially Any Trusted Setup | 406-423 |
| 2012 | crypto | Quantum to Classical Randomness Extractors | 776-793 |
| 2012 | crypto | Breaking and Repairing GCM Security Proofs | 31-49 |
| 2012 | crypto | To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC | 348-366 |
| 2012 | crypto | Secure Identity-Based Encryption in the Quantum Random Oracle Model | 758-775 |
| 2012 | crypto | Functional Encryption for Regular Languages | 218-235 |
| 2012 | crypto | An Enciphering Scheme Based on a Card Shuffle | 1-13 |
| 2012 | crypto | Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits | 255-272 |
| 2012 | crypto | Actively Secure Two-Party Evaluation of Any Quantum Operation | 794-811 |
| 2012 | crypto | Functional Encryption with Bounded Collusions via Multi-party Computation | 162-179 |
| 2012 | crypto | Secure Database Commitments and Universal Arguments of Quasi Knowledge | 236-254 |
| 2012 | crypto | Resistance against Iterated Attacks by Decorrelation Revisited, | 741-757 |
| 2012 | crypto | Adaptively Secure Multi-Party Computation with Dishonest Majority | 105-123 |
| 2012 | crypto | On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups | 812-831 |
| 2012 | crypto | Impossibility Results for Static Input Secure Computation | 424-442 |
| 2012 | crypto | Collusion-Preserving Computation | 124-143 |
| 2012 | crypto | Multiparty Computation from Somewhat Homomorphic Encryption | 643-662 |
| 2012 | crypto | Efficient Padding Oracle Attacks on Cryptographic Hardware | 608-625 |
| 2012 | crypto | Tightly Secure Signatures and Public-Key Encryption | 590-607 |
| 2012 | crypto | The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives | 701-718 |
| 2012 | crypto | Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves | 832-849 |
| 2012 | crypto | Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP | 868-886 |
| 2012 | crypto | Multi-instance Security and Its Application to Password-Based Cryptography | 312-329 |
| 2012 | crypto | Stam's Conjecture and Threshold Phenomena in Collision Resistance | 384-405 |
| 2012 | crypto | New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques | 180-198 |
| 2012 | crypto | Recent Advances and Existing Research Questions in Platform Security | 570 |
| 2012 | eurocrypt | Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $F_(p^6)$ | 9-26 |
| 2012 | eurocrypt | Malleable Proof Systems and Applications | 281-300 |
| 2012 | eurocrypt | Robust Coin Flipping | 172-194 |
| 2012 | eurocrypt | Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation | 682-699 |
| 2012 | eurocrypt | Identity-Based (Lossy) Trapdoor Functions and Applications | 228-245 |
| 2012 | eurocrypt | Message Authentication, Revisited | 355-374 |
| 2012 | eurocrypt | All-But-Many Lossy Trapdoor Functions | 209-227 |
| 2012 | eurocrypt | Identity-Based Encryption Resilient to Continual Auxiliary Leakage | 117-134 |
| 2012 | eurocrypt | Concurrently Secure Computation in Constant Rounds | 99-116 |
| 2012 | eurocrypt | Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More | 246-262 |
| 2012 | eurocrypt | Quantum Proofs of Knowledge | 135-152 |
| 2012 | eurocrypt | Standard Security Does Not Imply Security against Selective-Opening | 645-662 |
| 2012 | eurocrypt | Pseudorandom Functions and Lattices | 719-737 |
| 2012 | eurocrypt | Efficient Zero-Knowledge Argument for Correctness of a Shuffle | 263-280 |
| 2012 | eurocrypt | Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers | 502-519 |
| 2012 | eurocrypt | Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers | 446-464 |
| 2012 | eurocrypt | Lattice Signatures without Trapdoors | 738-755 |
| 2012 | eurocrypt | Statistical Tools Flavor Side-Channel Collision Attacks | 428-445 |
| 2012 | eurocrypt | On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model | 554-571 |
| 2012 | eurocrypt | Incremental Deterministic Public-Key Encryption | 628-644 |
| 2012 | eurocrypt | Another Look at Provable Security | 8 |
| 2012 | eurocrypt | Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H Attacks | 411-427 |
| 2012 | eurocrypt | Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security | 663-681 |
| 2012 | eurocrypt | Group to Group Commitments Do Not Shrink | 301-317 |
| 2012 | eurocrypt | Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE | 483-501 |
| 2012 | eurocrypt | Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) | 45-62 |
| 2012 | eurocrypt | Fair Computation with Rational Players | 81-98 |
| 2012 | eurocrypt | Narrow-Bicliques: Cryptanalysis of Full IDEA | 392-410 |
| 2012 | eurocrypt | Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting | 318-335 |
| 2012 | eurocrypt | Minimalism in Cryptography: The Even-Mansour Scheme Revisited | 336-354 |
| 2012 | eurocrypt | Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields | 27-44 |
| 2012 | eurocrypt | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding | 520-536 |
| 2012 | eurocrypt | Fully Homomorphic Encryption with Polylog Overhead | 465-482 |
| 2012 | eurocrypt | Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption | 591-608 |
| 2012 | eurocrypt | Tightly-Secure Signatures from Lossy Identification Schemes | 572-590 |
| 2012 | eurocrypt | Optimal Security Proofs for Full Domain Hash, Revisited | 537-553 |
| 2012 | eurocrypt | A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract) | 1-7 |
| 2012 | eurocrypt | Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller | 700-718 |
| 2012 | eurocrypt | Scalable Group Signatures with Revocation | 609-627 |
| 2012 | eurocrypt | Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading | 63-80 |
| 2012 | eurocrypt | Property Preserving Symmetric Encryption | 375-391 |
| 2012 | eurocrypt | Unconditionally-Secure Robust Secret Sharing with Compact Shares | 195-208 |
| 2012 | eurocrypt | On Round-Optimal Zero Knowledge in the Bare Public-Key Model | 153-171 |
| 2012 | eurocrypt | Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings | |
| 2012 | pkc | Public-Key Identification Schemes Based on Multivariate Cubic Polynomials | 172-189 |
| 2012 | pkc | The Construction of Ambiguous Optimistic Fair Exchange from Designated Confirmer Signature without Random Oracles | 120-137 |
| 2012 | pkc | On Definitions of Selective Opening Security | 522-539 |
| 2012 | pkc | Generating Provable Primes Efficiently on Embedded Devices | 372-389 |
| 2012 | pkc | Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices | 280-297 |
| 2012 | pkc | Multi-location Leakage Resilient Cryptography | 504-521 |
| 2012 | pkc | Strong Security from Probabilistic Signature Schemes | 84-101 |
| 2012 | pkc | Polly Cracker, Revisited, Revisited | 17-33 |
| 2012 | pkc | Constant-Round Multi-party Private Set Union Using Reversed Laurent Series | 398-412 |
| 2012 | pkc | New Definitions and Separations for Circular Security | 540-557 |
| 2012 | pkc | From Selective to Full Security: Semi-generic Transformations in the Standard Model | 316-333 |
| 2012 | pkc | Space Efficient Signature Schemes from the RSA Assumption | 102-119 |
| 2012 | pkc | Public Key Encryption against Related Key Attacks | 262-279 |
| 2012 | pkc | DDH-Like Assumptions Based on Extension Rings | 644-661 |
| 2012 | pkc | NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model | 353-371 |
| 2012 | pkc | Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith's Methods | 609-626 |
| 2012 | pkc | Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices | 467-484 |
| 2012 | pkc | Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies | 413-430 |
| 2012 | pkc | Outsider-Anonymous Broadcast Encryption with Sublinear Ciphertexts | 225-242 |
| 2012 | pkc | Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication | 243-261 |
| 2012 | pkc | Correlated Product Security from Any One-Way Function | 558-575 |
| 2012 | pkc | Password-Based Authenticated Key Exchange | 390-397 |
| 2012 | pkc | Waters Signatures with Optimal Security Reduction | 66-83 |
| 2012 | pkc | Variants of Waters' Dual System Primitives Using Asymmetric Pairings - (Extended Abstract) | 298-315 |
| 2012 | pkc | Ring-LWE in Polynomial Rings | 34-51 |
| 2012 | pkc | Extended-DDH and Lossy Trapdoor Functions | 627-643 |
| 2012 | pkc | On the Security of Dynamic Group Signatures: Preventing Signature Hijacking | 715-732 |
| 2012 | pkc | Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited | 156-171 |
| 2012 | pkc | Better Bootstrapping in Fully Homomorphic Encryption | 1-16 |
| 2012 | pkc | Security of Blind Signatures Revisited | 662-679 |
| 2012 | pkc | Efficient Password Authenticated Key Exchange via Oblivious Transfer | 449-466 |
| 2012 | pkc | Public-Key Cryptography from New Multivariate Quadratic Assumptions | 190-205 |
| 2012 | pkc | On Homomorphic Encryption and Chosen-Ciphertext Security | 52-65 |
| 2012 | pkc | Efficiently Shuffling in Public | 431-448 |
| 2012 | pkc | Improved Security for Linearly Homomorphic Signatures: A Generic Framework | 697-714 |
| 2012 | pkc | Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve | 595-608 |
| 2012 | pkc | Relations between Constrained and Bounded Chosen Ciphertext Security for Key Encapsulation Mechanisms | 576-594 |
| 2012 | pkc | Circular and KDM Security for Identity-Based Encryption | 334-352 |
| 2012 | pkc | Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes | 138-155 |
| 2012 | pkc | Efficient Network Coding Signatures in the Standard Model | 680-696 |
| 2012 | pkc | Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model | 206-224 |
| 2012 | pkc | Relatively-Sound NIZKs and Password-Based Key-Exchange | 485-503 |
| 2012 | tcc | On the Security of the "Free-XOR" Technique | 39-53 |
| 2012 | tcc | On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction | 285-302 |
| 2012 | tcc | Computational Extractors and Pseudorandomness | 383-403 |
| 2012 | tcc | How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption | 422-439 |
| 2012 | tcc | Point Obfuscation and 3-Round Zero-Knowledge | 190-208 |
| 2012 | tcc | Leakage-Resilient Circuits without Computational Assumptions | 230-247 |
| 2012 | tcc | Identifying Cheaters without an Honest Majority | 21-38 |
| 2012 | tcc | From Non-adaptive to Adaptive Pseudorandom Functions | 357-368 |
| 2012 | tcc | On Efficient Zero-Knowledge PCPs | 151-168 |
| 2012 | tcc | Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures | 133-150 |
| 2012 | tcc | On the Instantiability of Hash-and-Sign RSA Signatures | 112-132 |
| 2012 | tcc | Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments | 169-189 |
| 2012 | tcc | Confidentiality and Integrity: A Constructive Perspective | 209-229 |
| 2012 | tcc | Computing on Authenticated Data | 1-20 |
| 2012 | tcc | On Black-Box Reductions between Predicate Encryption Schemes | 440-457 |
| 2012 | tcc | Lossy Functions Do Not Amplify Well | 458-475 |
| 2012 | tcc | Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations | 636-653 |
| 2012 | tcc | A Parallel Repetition Theorem for Leakage Resilience | 248-265 |
| 2012 | tcc | Secure Two-Party Computation with Low Communication | 54-74 |
| 2012 | tcc | Resettable Statistical Zero Knowledge | 494-511 |
| 2012 | tcc | Simultaneously Resettable Arguments of Knowledge | 530-547 |
| 2012 | tcc | The Knowledge Tightness of Parallel Zero-Knowledge | 512-529 |
| 2012 | tcc | Bounded-Collusion IBE from Key Homomorphism | 564-581 |
| 2012 | tcc | Leakage-Tolerant Interactive Protocols | 266-284 |
| 2012 | tcc | Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources | 618-635 |
| 2012 | tcc | Functional Re-encryption and Collusion-Resistant Obfuscation | 404-421 |
| 2012 | tcc | Iterative Constructions and Private Data Release | 339-356 |
| 2012 | tcc | Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry | 303-320 |
| 2012 | tcc | Hardness Preserving Constructions of Pseudorandom Functions | 369-382 |
| 2012 | tcc | A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy | 582-599 |
| 2012 | tcc | A Dichotomy for Local Small-Bias Generators | 600-617 |
| 2012 | tcc | Subspace LWE | 548-563 |
| 2012 | tcc | Lower Bounds in Differential Privacy | 321-338 |
| 2012 | tcc | Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions | 75-93 |
| 2012 | tcc | Counterexamples to Hardness Amplification beyond Negligible | 476-493 |
| 2012 | tcc | Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions | 94-111 |
| 2012 | tcc | Theory of Cryptography - 9th Theory of Cryptography Conference, TCC 2012, Taormina, Sicily, Italy, March 19-21, 2012. Proceedings | |
