year |
venue |
title |
pages |
2017 | asiacrypt | Authenticated Encryption in the Face of Protocol and Side Channel Leakage | 693-723 |
2017 | asiacrypt | Faster Algorithms for Isogeny Problems Using Torsion Point Images | 330-353 |
2017 | asiacrypt | Preventing CLT Attacks on Obfuscation with Linear Overhead | 242-271 |
2017 | asiacrypt | JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes | 529-572 |
2017 | asiacrypt | On the Depth of Oblivious Parallel RAM | 567-597 |
2017 | asiacrypt | Blockcipher-Based MACs: Beyond the Birthday Bound Without Message Length | 446-470 |
2017 | asiacrypt | Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash | 304-335 |
2017 | asiacrypt | Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead | 629-659 |
2017 | asiacrypt | An Existential Unforgeable Signature Scheme Based on Multivariate Quadratic Equations | 37-64 |
2017 | asiacrypt | Instantaneous Decentralized Poker | 410-440 |
2017 | asiacrypt | The Iterated Random Function Problem | 667-697 |
2017 | asiacrypt | How to Use Metaheuristics for Design of Symmetric-Key Primitives | 369-391 |
2017 | asiacrypt | Efficient Ring Signatures in the Standard Model | 128-157 |
2017 | asiacrypt | Adaptive Oblivious Transfer with Access Control from Lattice Assumptions | 533-563 |
2017 | asiacrypt | Faster Packed Homomorphic Operations and Efficient Circuit Bootstrapping for TFHE | 377-408 |
2017 | asiacrypt | The Minimum Number of Cards in Practical Card-Based Protocols | 126-155 |
2017 | asiacrypt | Coded-BKW with Sieving | 323-346 |
2017 | asiacrypt | Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I | |
2017 | asiacrypt | Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions | 275-303 |
2017 | asiacrypt | Automatic Search of Bit-Based Division Property for ARX Ciphers and Word-Based Division Property | 128-157 |
2017 | asiacrypt | Quantum Fully Homomorphic Encryption with Verification | 438-467 |
2017 | asiacrypt | Tightly-Secure Signatures from Five-Move Identification Protocols | 68-94 |
2017 | asiacrypt | Grover Meets Simon - Quantumly Attacking the FX-construction | 161-178 |
2017 | asiacrypt | Symmetrically and Asymmetrically Hard Cryptography | 417-445 |
2017 | asiacrypt | New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers | 244-263 |
2017 | asiacrypt | Optimal-Rate Non-Committing Encryption | 212-241 |
2017 | asiacrypt | Analyzing Multi-key Security Degradation | 575-605 |
2017 | asiacrypt | Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups | 66-96 |
2017 | asiacrypt | qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs | 273-302 |
2017 | asiacrypt | The Sleepy Model of Consensus | 380-409 |
2017 | asiacrypt | Homomorphic Encryption for Arithmetic of Approximate Numbers | 409-437 |
2017 | asiacrypt | Two-Round PAKE from Approximate SPH and Instantiations from Lattices | 37-67 |
2017 | asiacrypt | Non-Interactive Multiparty Computation Without Correlated Randomness | 181-211 |
2017 | asiacrypt | An Efficient Pairing-Based Shuffle Argument | 97-127 |
2017 | asiacrypt | Post-quantum Security of Fiat-Shamir | 65-95 |
2017 | asiacrypt | An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography | 211-240 |
2017 | asiacrypt | Improved Security for OCB3 | 638-666 |
2017 | asiacrypt | Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space | 357-379 |
2017 | asiacrypt | A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies | 303-329 |
2017 | asiacrypt | Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II | |
2017 | asiacrypt | Large Modulus Ring-LWE ≥ Module-LWE | 267-296 |
2017 | asiacrypt | Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms | 241-270 |
2017 | asiacrypt | Linear Cryptanalysis of DES with Asymmetries | 187-216 |
2017 | asiacrypt | Overlaying Conditional Circuit Clauses for Secure Computation | 499-528 |
2017 | asiacrypt | Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems | 3-33 |
2017 | asiacrypt | Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability | 336-365 |
2017 | asiacrypt | A Subversion-Resistant SNARK | 3-33 |
2017 | asiacrypt | Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM | 660-690 |
2017 | asiacrypt | Strengthening Access Control Encryption | 502-532 |
2017 | asiacrypt | Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence | 347-374 |
2017 | asiacrypt | Revisiting the Expected Cost of Solving uSVP and Applications to LWE | 297-322 |
2017 | asiacrypt | Improved Conditional Cube Attacks on Keccak Keyed Modes with MILP Method | 99-127 |
2017 | asiacrypt | Quantum Multicollision-Finding Algorithm | 179-210 |
2017 | asiacrypt | Collisions and Semi-Free-Start Collisions for Round-Reduced RIPEMD-160 | 158-186 |
2017 | asiacrypt | On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications | 95-125 |
2017 | asiacrypt | Consolidating Inner Product Masking | 724-754 |
2017 | asiacrypt | More Efficient Universal Circuit Constructions | 443-470 |
2017 | asiacrypt | Amortizing Randomness Complexity in Private Circuits | 781-810 |
2017 | asiacrypt | Cycle Slicer: An Algorithm for Building Permutations on Special Domains | 392-416 |
2017 | asiacrypt | The First Thorough Side-Channel Hardware Trojan | 755-780 |
2017 | asiacrypt | Succinct Spooky Free Compilers Are Not Black Box Sound | 159-180 |
2017 | asiacrypt | Full-State Keyed Duplex with Built-In Multi-user Support | 606-637 |
2017 | asiacrypt | Yoyo Tricks with AES | 217-243 |
2017 | asiacrypt | Kummer for Genus One over Prime Order Fields | 3-32 |
2017 | asiacrypt | Efficient Scalable Constant-Round MPC via Garbled Circuits | 471-498 |
2017 | asiacrypt | Low Cost Constant Round MPC Combining BMR and Oblivious Transfer | 598-628 |
2017 | asiacrypt | ABE with Tag Made Easy - Concise Framework and New Instantiations in Prime-Order Groups | 35-65 |
2017 | asiacrypt | Access Control Encryption for General Policies from Standard Assumptions | 471-501 |
2017 | asiacrypt | Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part III | |
2017 | asiacrypt | The ship has sailed: the NIST Post-Quantum Cryptography "competition" | |
2017 | asiacrypt | Combinatorics in Information-Theoretic Cryptography | |
2017 | asiacrypt | White-box Cryptomania | |
2017 | ches | Your Rails Cannot Hide from Localized EM: How Dual-Rail Logic Fails on FPGAs | 403-424 |
2017 | ches | How to Break Secure Boot on FPGA SoCs Through Malicious Hardware | 425-442 |
2017 | ches | Illusion and Dazzle: Adversarial Optical Channel Exploits Against Lidars for Automotive Applications | 445-467 |
2017 | ches | Hacking in the Blind: (Almost) Invisible Runtime User Interface Attacks | 468-489 |
2017 | ches | On the Security of Carrier Phase-Based Ranging | 490-509 |
2017 | ches | Single-Trace Side-Channel Attacks on Masked Lattice-Based Encryption | 513-533 |
2017 | ches | A Systematic Approach to the Side-Channel Analysis of ECC Implementations with Worst-Case Horizontal Attacks | 534-554 |
2017 | ches | Sliding Right into Disaster: Left-to-Right Sliding Windows Leak | 555-576 |
2017 | ches | Faster Homomorphic Function Evaluation Using Non-integral Base Encoding | 579-600 |
2017 | ches | Hiding Secrecy Leakage in Leaky Helper Data | 601-619 |
2017 | ches | Convolutional Neural Networks with Data Augmentation Against Jitter-Based Countermeasures | 45-68 |
2017 | ches | Very High Order Masking: Efficient Implementation and Security Evaluation | 623-643 |
2017 | ches | PRESENT Runs Fast | 644-664 |
2017 | ches | Four$$\mathbb {Q}$$ on Embedded Devices with Strong Countermeasures Against Side-Channel Attacks | 665-686 |
2017 | ches | Bit-Sliding: A Generic Technique for Bit-Serial Implementations of SPN-based Primitives | 687-707 |
2017 | ches | CacheZoom: How SGX Amplifies the Power of Cache Attacks | 69-90 |
2017 | ches | High-Order Conversion from Boolean to Arithmetic Masking | 93-114 |
2017 | ches | Reconciling $$d+1$$ Masking in Hardware and Software | 115-136 |
2017 | ches | Changing of the Guards: A Simple and Efficient Method for Achieving Uniformity in Threshold Sharing | 137-153 |
2017 | ches | Generalized Polynomial Decomposition for S-boxes with Application to Side-Channel Countermeasures | 154-171 |
2017 | ches | Nanofocused X-Ray Beam to Reprogram Secure Circuits | 175-188 |
2017 | ches | HW security: A Foundry Perspective | |
2017 | ches | A Side-Channel Assisted Cryptanalytic Attack Against QcBits | 3-23 |
2017 | ches | Novel Bypass Attack and BDD-based Tradeoff Analysis Against All Known Logic Locking Attacks | 189-210 |
2017 | ches | McBits Revisited | 213-231 |
2017 | ches | High-Speed Key Encapsulation from NTRU | 232-252 |
2017 | ches | FPGA-based Key Generator for the Niederreiter Cryptosystem Using Binary Goppa Codes | 253-274 |
2017 | ches | Blockcipher-Based Authenticated Encryption: How Small Can We Go? | 277-298 |
2017 | ches | Gimli : A Cross-Platform Permutation | 299-320 |
2017 | ches | GIFT: A Small Present | 321-345 |
2017 | ches | Making Password Authenticated Key Exchange Suitable for Resource-Constrained Industrial Control Devices | 346-364 |
2017 | ches | Back to Massey: Impressively Fast, Scalable, and Tight Security Evaluation Tools | 367-386 |
2017 | ches | Fast Leakage Assessment | 387-399 |
2017 | ches | Improved Blind Side-Channel Analysis by Exploitation of Joint Distributions of Leakages | 24-44 |
2017 | crypto | Memory-Tight Reductions | 101-132 |
2017 | crypto | From Obfuscation to the Security of Fiat-Shamir for Proofs | 224-251 |
2017 | crypto | All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE | 332-364 |
2017 | crypto | The Price of Low Communication in Secure Multi-party Computation | 420-446 |
2017 | crypto | Laconic Oblivious Transfer and Its Applications | 33-65 |
2017 | crypto | Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak | 428-451 |
2017 | crypto | Boosting Authenticated Encryption Robustness with Minimal Modifications | 3-33 |
2017 | crypto | Degree Evaluation of NFSR-Based Cryptosystems | 227-249 |
2017 | crypto | Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs | 599-629 |
2017 | crypto | All-But-Many Lossy Trapdoor Functions from Lattices and Applications | 298-331 |
2017 | crypto | Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol | 357-388 |
2017 | crypto | Middle-Product Learning with Errors | 283-297 |
2017 | crypto | Four-Round Concurrent Non-Malleable Commitments from One-Way Functions | 127-157 |
2017 | crypto | Private Multiplication over Finite Fields | 397-426 |
2017 | crypto | ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication | 34-65 |
2017 | crypto | Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives | 661-695 |
2017 | crypto | Non-Malleable Codes for Space-Bounded Tampering | 95-126 |
2017 | crypto | Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I | |
2017 | crypto | Incremental Program Obfuscation | 193-223 |
2017 | crypto | Prospects for a Quantum Factoring Machine | |
2017 | crypto | Proving Resistance Against Invariant Attacks: How to Choose the Round Constants | 647-678 |
2017 | crypto | Deploying cryptographically-verified components for the HTTPS ecosystem | |
2017 | crypto | Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners | 404-427 |
2017 | crypto | Information-Theoretic Indistinguishability via the Chi-Squared Method | 497-523 |
2017 | crypto | Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization | 252-279 |
2017 | crypto | Encryption Switching Protocols Revisited: Switching Modulo p | 255-287 |
2017 | crypto | Hedging Public-Key Encryption in the Real World | 462-494 |
2017 | crypto | A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing | 682-710 |
2017 | crypto | Black-Box Parallel Garbled RAM | 66-92 |
2017 | crypto | New Security Notions and Feasibility Results for Authentication of Quantum Data | 342-371 |
2017 | crypto | PRF-ODH: Relations, Instantiations, and Impossibility Results | 651-681 |
2017 | crypto | A New Approach to Round-Optimal Secure Multiparty Computation | 468-499 |
2017 | crypto | Bitcoin as a Transaction Ledger: A Composable Treatment | 324-356 |
2017 | crypto | Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs | 630-660 |
2017 | crypto | Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs | 581-612 |
2017 | crypto | Amortization with Fewer Equations for Proving Knowledge of Small Secrets | 365-394 |
2017 | crypto | Generic Transformations of Predicate Encodings: Constructions and Applications | 36-66 |
2017 | crypto | Fast Secure Two-Party ECDSA Signing | 613-644 |
2017 | crypto | Anonymous Attestation with Subverted TPMs | 427-461 |
2017 | crypto | Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques | 161-193 |
2017 | crypto | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient | 524-555 |
2017 | crypto | The First Collision for Full SHA-1 | 570-596 |
2017 | crypto | Topology-Hiding Computation on All Graphs | 447-467 |
2017 | crypto | Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part II | |
2017 | crypto | Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic | 188-222 |
2017 | crypto | Message Franking via Committing Authenticated Encryption | 66-97 |
2017 | crypto | Identity-Based Encryption from Codes with Rank Metric | 194-224 |
2017 | crypto | Breaking the FF3 Format-Preserving Encryption Standard over Small Domains | 679-707 |
2017 | crypto | Quantum Non-malleability and Authentication | 310-341 |
2017 | crypto | The Bitcoin Backbone Protocol with Chains of Variable Difficulty | 291-323 |
2017 | crypto | Secure Arithmetic Computation with Constant Computational Overhead | 223-254 |
2017 | crypto | Robust Non-interactive Multiparty Computation Against Constant-Size Collusion | 391-419 |
2017 | crypto | Cube Attacks on Non-Blackbox Polynomials Based on Division Property | 250-279 |
2017 | crypto | Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme | 375-403 |
2017 | crypto | Kurosawa-Desmedt Meets Tight Security | 133-160 |
2017 | crypto | Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security | 708-732 |
2017 | crypto | Structure vs. Hardness Through the Obfuscation Lens | 696-723 |
2017 | crypto | Be Adaptive, Avoid Overcommitting | 133-163 |
2017 | crypto | Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time | 455-485 |
2017 | crypto | Identity-Based Encryption from the Diffie-Hellman Assumption | 537-569 |
2017 | crypto | Secure Computation Based on Leaky Correlations: High Resilience Setting | 3-32 |
2017 | crypto | Distinguisher-Dependent Simulation in Two Rounds and its Applications | 158-189 |
2017 | crypto | Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations | 727-757 |
2017 | crypto | The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited | 167-187 |
2017 | crypto | Ratcheted Encryption and Key Exchange: The Security of Messaging | 619-650 |
2017 | crypto | Conditional Disclosure of Secrets via Non-linear Reconstruction | 758-790 |
2017 | crypto | Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks | 3-35 |
2017 | crypto | Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory | 556-583 |
2017 | crypto | Compact Structure-Preserving Signatures with Almost Tight Security | 548-580 |
2017 | crypto | Key Rotation for Authenticated Encryption | 98-129 |
2017 | crypto | Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample | 517-547 |
2017 | crypto | Quantum Security of NMAC and Related Constructions - PRF Domain Extension Against Quantum attacks | 283-309 |
2017 | crypto | Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption | 67-98 |
2017 | crypto | A Formal Treatment of Multi-key Channels | 587-618 |
2017 | crypto | Watermarking Cryptographic Functionalities from Standard Lattice Assumptions | 503-536 |
2017 | crypto | Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III | |
2017 | crypto | LPN Decoded | 486-514 |
2017 | eurocrypt | Advances in computer-aided cryptography | |
2017 | eurocrypt | Living Between the Ideal and Real Worlds | |
2017 | eurocrypt | Modifying an Enciphering Scheme After Deployment | 499-527 |
2017 | eurocrypt | Private Puncturable PRFs from Standard Lattice Assumptions | 415-445 |
2017 | eurocrypt | Decentralized Anonymous Micropayments | 609-642 |
2017 | eurocrypt | Simplifying Design and Analysis of Complex Predicate Encryption Schemes | 627-656 |
2017 | eurocrypt | On the Exact Round Complexity of Self-composable Two-Party Computation | 194-224 |
2017 | eurocrypt | Removing the Strong RSA Assumption from Arguments over the Integers | 321-350 |
2017 | eurocrypt | Random Sampling Revisited: Lattice Enumeration with Discrete Pruning | 65-102 |
2017 | eurocrypt | Conditional Cube Attack on Reduced-Round Keccak Sponge Function | 259-288 |
2017 | eurocrypt | Revisiting Lattice Attacks on Overstretched NTRU Parameters | 3-26 |
2017 | eurocrypt | Ad Hoc PSM Protocols: Secure Computation Without Coordination | 580-608 |
2017 | eurocrypt | Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited | 473-495 |
2017 | eurocrypt | Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions | 30-61 |
2017 | eurocrypt | How Fast Can Higher-Order Masking Be in Software? | 567-597 |
2017 | eurocrypt | Patchable Indistinguishability Obfuscation: iO for Evolving Software | 127-155 |
2017 | eurocrypt | On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL | 103-129 |
2017 | eurocrypt | Breaking the Sub-Exponential Barrier in Obfustopia | 156-181 |
2017 | eurocrypt | Short Stickelberger Class Relations and Application to Ideal-SVP | 324-348 |
2017 | eurocrypt | Cryptography with Updates | 445-472 |
2017 | eurocrypt | Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions | 561-591 |
2017 | eurocrypt | Multi-input Inner-Product Functional Encryption from Pairings | 601-626 |
2017 | eurocrypt | Analysis of the Blockchain Protocol in Asynchronous Networks | 643-673 |
2017 | eurocrypt | New Impossible Differential Search Tool from Design and Cryptanalysis Aspects - Revealing Structural Properties of Several Ciphers | 185-215 |
2017 | eurocrypt | Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I | |
2017 | eurocrypt | Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption | 91-121 |
2017 | eurocrypt | Computational Integrity with a Public Random String from Quasi-Linear PCPs | 551-579 |
2017 | eurocrypt | Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries | 369-396 |
2017 | eurocrypt | From Minicrypt to Obfustopia via Private-Key Functional Encryption | 122-151 |
2017 | eurocrypt | Sublinear Zero-Knowledge Arguments for RAM Programs | 501-531 |
2017 | eurocrypt | Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity | 94-124 |
2017 | eurocrypt | Concurrently Composable Security with Shielded Super-Polynomial Simulators | 351-381 |
2017 | eurocrypt | Depth-Robust Graphs and Their Cumulative Memory Complexity | 3-32 |
2017 | eurocrypt | A Kilobit Hidden SNFS Discrete Logarithm Computation | 202-231 |
2017 | eurocrypt | Scrypt Is Maximally Memory-Hard | 33-62 |
2017 | eurocrypt | Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly | 311-338 |
2017 | eurocrypt | Faster Secure Two-Party Computation in the Single-Execution Setting | 399-424 |
2017 | eurocrypt | A Note on Perfect Correctness by Derandomization | 592-606 |
2017 | eurocrypt | On Removing Graded Encodings from Functional Encryption | 3-29 |
2017 | eurocrypt | Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts | 65-93 |
2017 | eurocrypt | Public-Seed Pseudorandom Permutations | 412-441 |
2017 | eurocrypt | Adaptive Partitioning | 489-518 |
2017 | eurocrypt | High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority | 225-255 |
2017 | eurocrypt | One-Shot Verifiable Encryption from Lattices | 293-323 |
2017 | eurocrypt | Efficient Compression of SIDH Public Keys | 679-706 |
2017 | eurocrypt | Lattice-Based SNARGs and Their Application to More Efficient Obfuscation | 247-277 |
2017 | eurocrypt | Topology-Hiding Computation Beyond Logarithmic Diameter | 609-637 |
2017 | eurocrypt | Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack | 479-500 |
2017 | eurocrypt | Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps | 152-181 |
2017 | eurocrypt | Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part II | |
2017 | eurocrypt | New Collision Attacks on Round-Reduced Keccak | 216-243 |
2017 | eurocrypt | Short Generators Without Quantum Computers: The Case of Multiquadratics | 27-59 |
2017 | eurocrypt | Twisted μ4-Normal Form for Elliptic Curves | 659-678 |
2017 | eurocrypt | Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs | 382-411 |
2017 | eurocrypt | Constraint-Hiding Constrained PRFs for NC1 from LWE | 446-476 |
2017 | eurocrypt | Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model | 535-566 |
2017 | eurocrypt | Improved Private Set Intersection Against Malicious Adversaries | 235-259 |
2017 | eurocrypt | Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption | 528-557 |
2017 | eurocrypt | Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation | 163-193 |
2017 | eurocrypt | Small CRT-Exponent RSA Revisited | 130-159 |
2017 | eurocrypt | Formal Abstractions for Attested Execution Secure Processors | 260-289 |
2017 | eurocrypt | Magic Adversaries Versus Individual Reduction: Science Wins Either Way | 351-377 |
2017 | eurocrypt | Hashing Garbled Circuits for Free | 456-485 |
2017 | eurocrypt | 0-RTT Key Exchange with Full Forward Secrecy | 519-548 |
2017 | eurocrypt | Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme | 60-88 |
2017 | eurocrypt | Computation of a 768-Bit Prime Field Discrete Logarithm | 185-201 |
2017 | eurocrypt | Cryptanalyses of Candidate Branching Program Obfuscators | 278-307 |
2017 | eurocrypt | Quantum Authentication with Key Recycling | 339-368 |
2017 | eurocrypt | A New Structural-Differential Property of 5-Round AES | 289-317 |
2017 | eurocrypt | The Multi-user Security of Double Encryption | 381-411 |
2017 | eurocrypt | Non-interactive Secure 2PC in the Offline/Online and Batch Settings | 425-455 |
2017 | eurocrypt | Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III | |
2017 | fse | Innovations in permutation-based encryption and/or authentication | |
2017 | fse | Design, Analysis and Promotion of (Lightweight) Block Ciphers | |
2017 | jofc | Instantiability of RSA-OAEP Under Chosen-Plaintext Attack | 889-919 |
2017 | jofc | Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier | 152-190 |
2017 | jofc | Acoustic Cryptanalysis | 392-443 |
2017 | jofc | Efficient Cryptosystems From 2k-th Power Residue Symbols | 519-549 |
2017 | jofc | The Hunting of the SNARK | 989-1066 |
2017 | jofc | Efficient Authentication from Hard Learning Problems | 1238-1275 |
2017 | jofc | Information Theoretical Cryptogenography | 1067-1115 |
2017 | jofc | Photonic Side-Channel Analysis of Arbiter PUFs | 550-571 |
2017 | jofc | Differential-Linear Cryptanalysis Revisited | 859-888 |
2017 | jofc | Weak Locking Capacity of Quantum Channels Can be Much Larger Than Private Capacity | 1-21 |
2017 | jofc | From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back | 961-988 |
2017 | jofc | Merkle's Key Agreement Protocol is Optimal: An O(n2) Attack on Any Key Agreement from Random Oracles | 699-734 |
2017 | jofc | Reconciling Non-malleability with Homomorphic Encryption | 601-671 |
2017 | jofc | Lattices with Symmetry | 760-804 |
2017 | jofc | Design Methodology and Validity Verification for a Reactive Countermeasure Against EM Attacks | 373-391 |
2017 | jofc | The Security of Tandem-DM in the Ideal Cipher Model | 495-518 |
2017 | jofc | Locally Computable UOWHF with Linear Shrinkage | 672-698 |
2017 | jofc | Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation | 1157-1186 |
2017 | jofc | Jacobian Coordinates on Genus 2 Curves | 572-600 |
2017 | jofc | Obfuscating Conjunctions | 289-320 |
2017 | jofc | Secret-Sharing for NP | 444-469 |
2017 | jofc | An Algebraic Framework for Diffie-Hellman Assumptions | 242-288 |
2017 | jofc | Dynamic Proofs of Retrievability Via Oblivious RAM | 22-57 |
2017 | jofc | Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces | 1116-1156 |
2017 | jofc | A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation | 58-151 |
2017 | jofc | Efficient One-Sided Adaptively Secure Computation | 321-371 |
2017 | jofc | More Efficient Oblivious Transfer Extensions | 805-858 |
2017 | jofc | Security of Blind Signatures Revisited | 470-494 |
2017 | jofc | Integral Cryptanalysis on Full MISTY1 | 920-959 |
2017 | jofc | Authenticated Confidential Channel Establishment and the Security of TLS-DHE | 1276-1324 |
2017 | jofc | Non-malleable Coding Against Bit-Wise and Split-State Tampering | 191-241 |
2017 | jofc | Short Signatures from Diffie-Hellman: Realizing Almost Compact Public Key | 735-759 |
2017 | jofc | Reproducible Circularly Secure Bit Encryption: Applications and Realizations | 1187-1237 |
2017 | pkc | Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II | |
2017 | pkc | LP Solutions of Vectorial Integer Subset Sums - Cryptanalysis of Galbraith's Binary Matrix LWE | 3-15 |
2017 | pkc | A Modular Security Analysis of EAP and IEEE 802.11 | 335-365 |
2017 | pkc | Fully Leakage-Resilient Codes | 333-358 |
2017 | pkc | Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems | 435-464 |
2017 | pkc | Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash | 61-90 |
2017 | pkc | Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree | 388-408 |
2017 | pkc | Access Control Encryption for Equality, Comparison, and More | 88-118 |
2017 | pkc | On the Computational Overhead of MPC with Dishonest Majority | 369-395 |
2017 | pkc | Separating IND-CPA and Circular Security for Unbounded Length Key Cycles | 232-246 |
2017 | pkc | Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation | 463-493 |
2017 | pkc | Improved Algorithms for the Approximate k-List Problem in Euclidean Norm | 16-40 |
2017 | pkc | Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes | 310-332 |
2017 | pkc | On the Bit Security of Elliptic Curve Diffie-Hellman | 361-387 |
2017 | pkc | Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 | 41-58 |
2017 | pkc | The Evolution of Public Key Cryptography in SSL/TLS | |
2017 | pkc | Recent Advances in Non-Malleable Cryptography | |
2017 | pkc | Ceremonies for End-to-End Verifiable Elections | 305-334 |
2017 | pkc | Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model | 428-460 |
2017 | pkc | Chosen-Ciphertext Secure Fully Homomorphic Encryption | 213-240 |
2017 | pkc | Better Two-Round Adaptive Multi-party Computation | 396-427 |
2017 | pkc | Tightly Secure IBE Under Constant-Size Master Public Key | 207-231 |
2017 | pkc | Universal Samplers with Fast Verification | 525-554 |
2017 | pkc | Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions | 67-87 |
2017 | pkc | Circuit-Private Multi-key FHE | 241-270 |
2017 | pkc | Scalable Multi-party Private Set-Intersection | 175-203 |
2017 | pkc | Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part I | |
2017 | pkc | Removing Erasures with Explainable Hash Proof Systems | 151-174 |
2017 | pkc | Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts | 247-276 |
2017 | pkc | Chameleon-Hashes with Ephemeral Trapdoors - And Applications to Invisible Sanitizable Signatures | 152-182 |
2017 | pkc | Asymptotically Tight Bounds for Composing ORAM with PIR | 91-120 |
2017 | pkc | Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures | 121-151 |
2017 | pkc | FHE over the Integers: Decomposed and Batched in the Post-Quantum Regime | 271-301 |
2017 | pkc | Provably Secure NTRU Instances over Prime Cyclotomic Rings | 409-434 |
2017 | pkc | Constraining Pseudorandom Functions Privately | 494-524 |
2017 | pkc | Improved Structure Preserving Signatures Under Standard Bilinear Assumptions | 183-209 |
2017 | pkc | Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits | 3-35 |
2017 | pkc | Predictable Arguments of Knowledge | 121-150 |
2017 | pkc | CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions | 36-66 |
2017 | pkc | Non-malleable Codes with Split-State Refresh | 279-309 |
2017 | tcc | To Cyclicity and Beyond! | |
2017 | tcc | Theory for Society: Fairness in Classification | |
2017 | tcc | On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i | 445-465 |
2017 | tcc | Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited | 206-233 |
2017 | tcc | Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model | 3-39 |
2017 | tcc | On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs | 31-55 |
2017 | tcc | Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions | 581-611 |
2017 | tcc | Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners | 245-279 |
2017 | tcc | Inception Makes Non-malleable Codes Stronger | 319-343 |
2017 | tcc | Round-Optimal Secure Two-Party Computation from Trapdoor Permutations | 678-710 |
2017 | tcc | When Does Functional Encryption Imply Obfuscation? | 82-115 |
2017 | tcc | Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation | 119-137 |
2017 | tcc | Four-State Non-malleable Codes with Explicit Constant Rate | 344-375 |
2017 | tcc | Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I | |
2017 | tcc | Round Optimal Concurrent MPC via Strong Simulation | 743-775 |
2017 | tcc | Constrained Keys for Invertible Pseudorandom Functions | 237-263 |
2017 | tcc | Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness | 138-169 |
2017 | tcc | Can We Access a Database Both Locally and Privately? | 662-693 |
2017 | tcc | Four Round Secure Computation Without Setup | 645-677 |
2017 | tcc | Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0 | 424-458 |
2017 | tcc | Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension | 597-627 |
2017 | tcc | Bandwidth Hard Functions for ASIC Resistance | 466-492 |
2017 | tcc | Strengthening the Security of Encrypted Databases: Non-transitive JOINs | 631-661 |
2017 | tcc | Resettably-Sound Resettable Zero Knowledge in Constant Rounds | 111-138 |
2017 | tcc | Barriers to Black-Box Constructions of Traitor Tracing Systems | 3-30 |
2017 | tcc | How to Construct a Leakage-Resilient (Stateless) Trusted Party | 209-244 |
2017 | tcc | Position-Based Cryptography and Multiparty Communication Complexity | 56-81 |
2017 | tcc | The Edited Truth | 305-340 |
2017 | tcc | Functional Encryption for Bounded Collusions, Revisited | 173-205 |
2017 | tcc | Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II | |
2017 | tcc | Linear Secret-Sharing Schemes for Forbidden Graph Access Structures | 394-423 |
2017 | tcc | A Modular Analysis of the Fujisaki-Okamoto Transformation | 341-371 |
2017 | tcc | Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs | 72-107 |
2017 | tcc | A Generic Approach to Constructing and Proving Verifiable Random Functions | 537-566 |
2017 | tcc | Towards Doubly Efficient Private Information Retrieval | 694-726 |
2017 | tcc | A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models | 776-809 |
2017 | tcc | Round Optimal Concurrent Non-malleability from Polynomial Hardness | 139-171 |
2017 | tcc | Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs | 567-594 |
2017 | tcc | Secure Two-Party Computation with Fairness - A Necessary Design Principle | 565-580 |
2017 | tcc | On the One-Per-Message Unforgeability of (EC)DSA and Its Variants | 519-534 |
2017 | tcc | Evolving Secret Sharing: Dynamic Thresholds and Robustness | 379-393 |
2017 | tcc | On Secure Two-Party Computation in Three Rounds | 612-644 |
2017 | tcc | From Selective IBE to Full IBE and Selective HIBE | 372-408 |
2017 | tcc | Moderately Hard Functions: Definition, Instantiations, and Applications | 493-526 |
2017 | tcc | Resource-Efficient OT Combiners with Active Security | 461-486 |
2017 | tcc | On Iterative Collision Search for LPN and Subset Sum | 729-746 |
2017 | tcc | Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds | 711-742 |
2017 | tcc | Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy | 409-441 |
2017 | tcc | Adaptively Indistinguishable Garbled Circuits | 40-71 |
2017 | tcc | Zero Knowledge Protocols from Succinct Constraint Detection | 172-206 |
2017 | tcc | Overcoming Cryptographic Impossibility Results Using Blockchains | 529-561 |
2017 | tcc | Can PPAD Hardness be Based on Standard Cryptographic Assumptions? | 747-776 |
2017 | tcc | An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both | 489-518 |
2017 | tcc | On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments | 283-315 |
2017 | tcc | Private Constrained PRFs (and More) from LWE | 264-302 |
2017 | tosc | ZMAC+ - An Efficient Variable-output-length Variant of ZMAC | online |
2017 | tosc | Differentially 4-Uniform Permutations with the Best Known Nonlinearity from Butterflies | online |
2017 | tosc | Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds | online |
2017 | tosc | Accurate Estimate of the Advantage of Impossible Differential Attacks | online |
2017 | tosc | Fast Correlation Attacks on Grain-like Small State Stream Ciphers | online |
2017 | tosc | Tight Security Analysis of EHtM MAC | online |
2017 | tosc | Direct Construction of Optimal Rotational-XOR Diffusion Primitives | online |
2017 | tosc | Practical Evaluation of FSE 2016 Customized Encoding Countermeasure | online |
2017 | tosc | Shorter Linear Straight-Line Programs for MDS Matrices | online |
2017 | tosc | Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3 | online |
2017 | tosc | Some cryptanalytic results on Lizard | online |
2017 | tosc | On Leakage-Resilient Authenticated Encryption with Decryption Leakages | online |
2017 | tosc | Single Key Variant of PMAC_Plus | online |
2017 | tosc | Analysis and Improvement of Entropy Estimators in NIST SP 800-90B for Non-IID Entropy Sources | online |
2017 | tosc | Human-readable Proof of the Related-Key Security of AES-128 | online |
2017 | tosc | Rotational-XOR Cryptanalysis of Reduced-round SPECK | online |
2017 | tosc | Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures | online |
2017 | tosc | Modes of Operation Suitable for Computing on Encrypted Data | online |
2017 | tosc | New Constructions of MACs from (Tweakable) Block Ciphers | online |
2017 | tosc | Optimizing Implementations of Lightweight Building Blocks | online |
2017 | tosc | Farfalle: parallel permutation-based cryptography | online |
2017 | tosc | Turning Online Ciphers Off | online |
2017 | tosc | Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security | online |
2017 | tosc | Cryptanalysis of PMACx, PMAC2x, and SIVx | online |
2017 | tosc | MILP Modeling for (Large) S-boxes to Optimize Probability of Differential Characteristics | online |
2017 | tosc | Understanding RUP Integrity of COLM | online |
2017 | tosc | Grøstl Distinguishing Attack: A New Rebound Attack of an AES-like Permutation | online |
2017 | tosc | A Security Analysis of Deoxys and its Internal Tweakable Block Ciphers | online |
2017 | tosc | Optimal PRFs from Blockcipher Designs | online |
2017 | tosc | Security of Even-Mansour Ciphers under Key-Dependent Messages | online |
2017 | tosc | Cryptanalysis of 48-step RIPEMD-160 | online |
2017 | tosc | Reconsidering the Security Bound of AES-GCM-SIV | online |
2017 | tosc | Efficient Length Doubling From Tweakable Block Ciphers | online |
2017 | tosc | Boolean functions with restricted input and their robustness; application to the FLIP cipher | online |
2017 | tosc | Security Analysis of SKINNY under Related-Tweakey Settings (Long Paper) | online |
2017 | tosc | Analysis of Software Countermeasures for Whitebox Encryption | online |
2017 | tosc | The QARMA Block Cipher Family. Almost MDS Matrices Over Rings With Zero Divisors, Nearly Symmetric Even-Mansour Constructions With Non-Involutory Central Rounds, and Search Heuristics for Low-Latency S-Boxes | online |
2017 | tosc | Optimal Differential Trails in SIMON-like Ciphers | online |
2017 | tosc | A Fast Single-Key Two-Level Universal Hash Function | online |
2017 | tosc | On The Exact Security of Message Authentication Using Pseudorandom Functions | online |
2017 | tosc | LIZARD - A Lightweight Stream Cipher for Power-constrained Devices | online |
2017 | tosc | Design of Lightweight Linear Diffusion Layers from Near-MDS Matrices | online |
2017 | tosc | SymSum: Symmetric-Sum Distinguishers Against Round Reduced SHA3 | online |
2017 | tosc | Preface | online |
2017 | tosc | ISAP - Towards Side-Channel Secure Authenticated Encryption | online |
2017 | tosc | Cryptanalysis of NORX v2.0 | online |
2017 | tosc | Security Notions for Bidirectional Channels | online |
2017 | tosc | Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers | online |
2017 | tosc | Security of Symmetric Primitives under Incorrect Usage of Keys | online |
2017 | tosc | Cryptanalysis of GOST2 | online |
2017 | tosc | A Note on 5-bit Quadratic Permutations' Classification | online |
2017 | tosc | New techniques for trail bounds and application to differential trails in Keccak | online |
2017 | tosc | SoK: Security Models for Pseudo-Random Number Generators | online |
2017 | tosc | The Approximate k-List Problem | online |
2017 | tosc | Conditional Cube Attack on Round-Reduced ASCON | online |
2017 | tosc | Meet-in-the-Middle Attacks on Reduced-Round Midori64 | online |
2017 | tosc | Analysis of AES, SKINNY, and Others with Constraint Programming | online |
2017 | tosc | Cube-like Attack on Round-Reduced Initialization of Ketje Sr | online |