year |
venue |
title |
pages |
2018 | asiacrypt | Secure Computation with Low Communication from Cross-Checking | 59-85 |
2018 | asiacrypt | Picnic: Postquantum signatures from zero-knowledge proofs | |
2018 | asiacrypt | Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT) | 86-117 |
2018 | asiacrypt | Democracy, security and evidence: let's have all three | |
2018 | asiacrypt | Non-interactive Secure Computation from One-Way Functions | 118-138 |
2018 | asiacrypt | Simple and Efficient Two-Server ORAM | 141-157 |
2018 | asiacrypt | More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting | 158-188 |
2018 | asiacrypt | A Universally Composable Framework for the Privacy of Email Ecosystems | 191-221 |
2018 | asiacrypt | State Separation for Code-Based Game-Playing Proofs | 222-249 |
2018 | asiacrypt | Security of the Blockchain Against Long Delay Attack | 250-275 |
2018 | asiacrypt | Homomorphic Secret Sharing for Low Degree Polynomials | 279-309 |
2018 | asiacrypt | Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem | 310-331 |
2018 | asiacrypt | Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols | 332-362 |
2018 | asiacrypt | Towards Practical Key Exchange from Ordinary Isogeny Graphs | 365-394 |
2018 | asiacrypt | CSIDH: An Efficient Post-Quantum Commutative Group Action | 395-427 |
2018 | asiacrypt | Computing Supersingular Isogenies on Kummer Surfaces | 428-456 |
2018 | asiacrypt | Robustly Reusable Fuzzy Extractor from Standard Assumptions | 459-489 |
2018 | asiacrypt | Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH | 490-518 |
2018 | asiacrypt | Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove | 519-550 |
2018 | asiacrypt | Block Cipher Invariants as Eigenvectors of Correlation Matrices | 3-31 |
2018 | asiacrypt | Practical Attacks Against the Walnut Digital Signature Scheme | 35-61 |
2018 | asiacrypt | Two Attacks on Rank Metric Code-Based Schemes: RankSign and an IBE Scheme | 62-92 |
2018 | asiacrypt | An Efficient Structural Attack on NIST Submission DAGS | 93-118 |
2018 | asiacrypt | Pattern Matching on Encrypted Streams | 121-148 |
2018 | asiacrypt | SQL on Structurally-Encrypted Databases | 149-180 |
2018 | asiacrypt | Parameter-Hiding Order Revealing Encryption | 181-210 |
2018 | asiacrypt | Revisiting Key-Alternating Feistel Ciphers for Shorter Keys and Multi-user Security | 213-243 |
2018 | asiacrypt | Short Variable Length Domain Extenders with Beyond Birthday Bound Security | 244-274 |
2018 | asiacrypt | Building Quantum-One-Way Functions from Block Ciphers: Davies-Meyer and Merkle-Damgård Constructions | 275-304 |
2018 | asiacrypt | Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model | 305-335 |
2018 | asiacrypt | ZCZ – Achieving n-bit SPRP Security with a Minimal Number of Tweakable-Block-Cipher Calls | 336-366 |
2018 | asiacrypt | Measuring, Simulating and Exploiting the Head Concavity Phenomenon in BKZ | 369-404 |
2018 | asiacrypt | Quantum Lattice Enumeration and Tweaking Discrete Pruning | 405-434 |
2018 | asiacrypt | On the Hardness of the Computational Ring-LWR Problem and Its Applications | 435-464 |
2018 | asiacrypt | On the Statistical Leak of the GGH13 Multilinear Map and Some Variants | 465-493 |
2018 | asiacrypt | LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS | 494-524 |
2018 | asiacrypt | Quantum Algorithms for the $$k$$-xor Problem | 527-559 |
2018 | asiacrypt | Hidden Shift Quantum Cryptanalysis and Implications | 560-592 |
2018 | asiacrypt | Arya: Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution | 595-626 |
2018 | asiacrypt | Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications | 627-656 |
2018 | asiacrypt | Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints | 3-34 |
2018 | asiacrypt | Cryptanalysis of MORUS | 35-64 |
2018 | asiacrypt | New MILP Modeling: Improved Conditional Cube Attacks on Keccak-Based Constructions | 65-95 |
2018 | asiacrypt | On the Concrete Security of Goldreich’s Pseudorandom Generator | 96-124 |
2018 | asiacrypt | A Framework for Achieving KDM-CCA Secure Public-Key Encryption | 127-157 |
2018 | asiacrypt | Understanding and Constructing AKE via Double-Key Key Encapsulation Mechanism | 158-189 |
2018 | asiacrypt | Identity-Based Encryption Tightly Secure Under Chosen-Ciphertext Attacks | 190-220 |
2018 | asiacrypt | Short Digital Signatures and ID-KEMs via Truncation Collision Resistance | 221-250 |
2018 | asiacrypt | Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model | 253-282 |
2018 | asiacrypt | New Instantiations of the CRYPTO 2017 Masking Schemes | 285-314 |
2018 | asiacrypt | Statistical Ineffective Fault Attacks on Masked AES with Fault Countermeasures | 315-342 |
2018 | asiacrypt | Tight Private Circuits: Achieving Probing Security with the Least Refreshing | 343-372 |
2018 | asiacrypt | Attacks and Countermeasures for White-box Designs | 373-402 |
2018 | asiacrypt | Signatures with Flexible Public Key: Introducing Equivalence Classes for Public Keys | 405-434 |
2018 | asiacrypt | Compact Multi-signatures for Smaller Blockchains | 435-464 |
2018 | asiacrypt | Multi-key Homomorphic Signatures Unforgeable Under Insider Corruption | 465-492 |
2018 | asiacrypt | 25 Years of Linear Cryptanalysis - Early History and Path Search Algorithm | |
2018 | asiacrypt | Attribute-Based Signatures for Unbounded Languages from Standard Assumptions | 493-522 |
2018 | asiacrypt | Learning Strikes Again: The Case of the DRS Signature Scheme | 525-543 |
2018 | asiacrypt | How to Securely Compute with Noisy Leakage in Quasilinear Complexity | 547-574 |
2018 | asiacrypt | Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation | 575-606 |
2018 | asiacrypt | Unbounded Inner Product Functional Encryption from Bilinear Maps | 609-639 |
2018 | asiacrypt | Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption | 640-672 |
2018 | asiacrypt | Improved Inner-Product Encryption with Adaptive Security and Full Attribute-Hiding | 673-702 |
2018 | asiacrypt | Decentralized Multi-Client Functional Encryption for Inner Product | 703-732 |
2018 | asiacrypt | Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p | 733-764 |
2018 | asiacrypt | On Multiparty Garbling of Arithmetic Circuits | 3-33 |
2018 | asiacrypt |
$$\mathsf {Free\ }{} \mathtt{IF} $$
: How to Omit Inactive Branches and Implement
$$\mathcal {S}$$
-Universal Garbled Circuit (Almost) for Free | 34-58 |
2018 | ches | (Why) Are Microarchitectural Attacks Really Different than Physical Side-Channel Attacks? | |
2018 | ches | Leveraging Deep-Learning to Perform SCA Attacks against AES Implementations | |
2018 | crypto | Crypto: a Key Ingredient to Building Respectful Products | |
2018 | crypto | TinyKeys: A New Approach to Efficient Multi-Party Computation | 3-33 |
2018 | crypto | Two-Round Multiparty Secure Computation Minimizing Public Key Operations | 273-301 |
2018 | crypto | Limits of Practical Sublinear Secure Computation | 302-332 |
2018 | crypto | Limits on the Power of Garbling Techniques for Public-Key Encryption | 335-364 |
2018 | crypto | Optimizing Authenticated Garbling for Faster Secure Two-Party Computation | 365-391 |
2018 | crypto | Amortized Complexity of Information-Theoretically Secure MPC Revisited | 395-426 |
2018 | crypto | Private Circuits: A Modular Approach | 427-455 |
2018 | crypto | A New Public-Key Cryptosystem via Mersenne Numbers | 459-482 |
2018 | crypto | Fast Homomorphic Evaluation of Deep Discretized Neural Networks | 483-512 |
2018 | crypto | Adaptive Garbled RAM from Laconic Oblivious Transfer | 515-544 |
2018 | crypto | On the Round Complexity of OT Extension | 545-574 |
2018 | crypto | Fast Large-Scale Honest-Majority MPC for Malicious Adversaries | 34-64 |
2018 | crypto | Non-Malleable Codes for Partial Functions with Manipulation Detection | 577-607 |
2018 | crypto | Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions | 608-639 |
2018 | crypto | Non-Interactive Zero-Knowledge Proofs for Composite Statements | 643-673 |
2018 | crypto | From Laconic Zero-Knowledge to Public-Key Cryptography | 674-697 |
2018 | crypto | Updatable and Universal Common Reference Strings with Applications to zk-SNARKs | 698-728 |
2018 | crypto | A Simple Obfuscation Scheme for Pattern-Matching with Wildcards | 731-752 |
2018 | crypto | On the Complexity of Compressing Obfuscation | 753-783 |
2018 | crypto | Quantum FHE (Almost) As Secure As Classical | 67-95 |
2018 | crypto | IND-CCA-Secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited | 96-125 |
2018 | crypto | Pseudorandom Quantum States | 126-152 |
2018 | crypto | Quantum Attacks Against Indistinguishablility Obfuscators Proved Secure in the Weak Multilinear Map Model | 153-183 |
2018 | crypto | Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem | 184-210 |
2018 | crypto | An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing | 213-242 |
2018 | crypto | Must the Communication Graph of MPC Protocols be an Expander? | 243-272 |
2018 | crypto | Simplifying Game-Based Definitions | 3-32 |
2018 | crypto | Combiners for Backdoored Random Oracles | 272-302 |
2018 | crypto | On Distributional Collision Resistant Hashing | 303-327 |
2018 | crypto | Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries | 331-361 |
2018 | crypto | Trapdoor Functions from the Computational Diffie-Hellman Assumption | 362-391 |
2018 | crypto | Round-Optimal Secure Multiparty Computation with Honest Majority | 395-424 |
2018 | crypto | On the Exact Round Complexity of Secure Three-Party Computation | 425-458 |
2018 | crypto | Promise Zero Knowledge and Its Applications to Round Optimal MPC | 459-487 |
2018 | crypto | Round-Optimal Secure Multi-Party Computation | 488-520 |
2018 | crypto | Yes, There is an Oblivious RAM Lower Bound! | 523-542 |
2018 | crypto | Constrained PRFs for $$\mathrm{NC}^1$$ in Traditional Groups | 543-574 |
2018 | crypto | The Algebraic Group Model and its Applications | 33-62 |
2018 | crypto | GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates | 577-607 |
2018 | crypto | Lower Bounds on Lattice Enumeration with Extreme Pruning | 608-637 |
2018 | crypto | Dissection-BKW | 638-666 |
2018 | crypto | Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits | 669-699 |
2018 | crypto | Lattice-Based Zero-Knowledge Arguments for Integer Relations | 700-732 |
2018 | crypto | Multi-Theorem Preprocessing NIZKs from Lattices | 733-765 |
2018 | crypto | SPD$$\mathbb {Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for Dishonest Majority | 769-798 |
2018 | crypto | Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings | 799-829 |
2018 | crypto | On Tightly Secure Non-Interactive Key Exchange | 65-94 |
2018 | crypto | Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange | 95-125 |
2018 | crypto | Fast Correlation Attack Revisited | 129-159 |
2018 | crypto | A Key-Recovery Attack on 855-round Trivium | 160-184 |
2018 | crypto | Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities | 185-212 |
2018 | crypto | Bernstein Bound on WCS is Tight | 213-238 |
2018 | crypto | Correcting Subverted Random Oracles | 241-271 |
2018 | crypto | Towards Bidirectional Ratcheted Key Exchange | 3-32 |
2018 | crypto | Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly | 275-305 |
2018 | crypto | Generic Attacks Against Beyond-Birthday-Bound MACs | 306-336 |
2018 | crypto | Structured Encryption and Leakage Suppression | 339-370 |
2018 | crypto | Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency | 371-406 |
2018 | crypto | Tight Tradeoffs in Searchable Symmetric Encryption | 407-436 |
2018 | crypto | Hardness of Non-interactive Differential Privacy from One-Way Functions | 437-466 |
2018 | crypto | Risky Traitor Tracing and New Differential Privacy Negative Results | 467-497 |
2018 | crypto | Non-malleable Secret Sharing for General Access Structures | 501-530 |
2018 | crypto | On the Local Leakage Resilience of Linear Secret Sharing Schemes | 531-561 |
2018 | crypto | Threshold Cryptosystems from Threshold Fully Homomorphic Encryption | 565-596 |
2018 | crypto | Optimal Channel Security Against Fine-Grained State Compromise: The Safety of Messaging | 33-62 |
2018 | crypto | Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions Without Pairings | 597-627 |
2018 | crypto | Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC | 631-661 |
2018 | crypto | Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit | 662-692 |
2018 | crypto | Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models | 693-721 |
2018 | crypto | Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks | 722-753 |
2018 | crypto | Verifiable Delay Functions | 757-788 |
2018 | crypto | Proofs of Work From Worst-Case Assumptions | 789-819 |
2018 | crypto | Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal | 63-89 |
2018 | crypto | Faster Homomorphic Linear Transformations in HElib | 93-120 |
2018 | crypto | CAPA: The Spirit of Beaver Against Physical Attacks | 121-151 |
2018 | crypto | Fast Message Franking: From Invisible Salamanders to Encryptment | 155-186 |
2018 | crypto | Indifferentiable Authenticated Encryption | 187-220 |
2018 | crypto | The Curse of Small Domains: New Attacks on Format-Preserving Encryption | 221-251 |
2018 | crypto | Cryptanalysis via Algebraic Spans | 255-274 |
2018 | crypto | From Idea to Impact, the Crypto story: What's next? | |
2018 | eurocrypt | Thirty Years of Digital Currency: From DigiCash to the Blockchain | |
2018 | eurocrypt | Desperately Seeking Sboxes | |
2018 | eurocrypt | Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation) | 649-679 |
2018 | eurocrypt | Unforgeable Quantum Encryption | 489-519 |
2018 | eurocrypt | Sustained Space Complexity | 99-130 |
2018 | eurocrypt | Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the \chi ^2 Method | 387-412 |
2018 | eurocrypt | Homomorphic SIM ^2 D Operations: Single Instruction Much More Data | 338-359 |
2018 | eurocrypt | Bootstrapping for Approximate Homomorphic Encryption | 360-384 |
2018 | eurocrypt | Simple Proofs of Sequential Work | 451-467 |
2018 | eurocrypt | k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits | 500-532 |
2018 | eurocrypt | But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin | 34-65 |
2018 | eurocrypt | Memory Lower Bounds of Reductions Revisited | 61-90 |
2018 | eurocrypt | Boomerang Connectivity Table: A New Cryptanalysis Tool | 683-714 |
2018 | eurocrypt | The Missing Difference Problem, and Its Applications to Counter Mode Encryption | 745-770 |
2018 | eurocrypt | Non-malleable Codes from Average-Case Hardness: $${\mathsf {A}}{\mathsf {C}}^0$$ , Decision Trees, and Streaming Space-Bounded Tampering | 618-650 |
2018 | eurocrypt | Non-malleable Randomness Encoders and Their Applications | 589-617 |
2018 | eurocrypt | Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs | 204-224 |
2018 | eurocrypt | Multi-Collision Resistant Hash Functions and Their Applications | 133-161 |
2018 | eurocrypt | On the Complexity of Simulating Auxiliary Input | 371-390 |
2018 | eurocrypt | Efficient Circuit-Based PSI via Cuckoo Hashing | 125-157 |
2018 | eurocrypt | On the Existence of Three Round Zero-Knowledge Proofs | 3-33 |
2018 | eurocrypt | Untagging Tor: A Formal Treatment of Onion Encryption | 259-293 |
2018 | eurocrypt | Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model | 520-551 |
2018 | eurocrypt | Efficient Maliciously Secure Multiparty Computation for RAM | 91-124 |
2018 | eurocrypt | On the Ring-LWE and Polynomial-LWE Problems | 146-173 |
2018 | eurocrypt | A New Approach to Black-Box Concurrent Secure Computation | 566-599 |
2018 | eurocrypt | Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain | 66-98 |
2018 | eurocrypt | Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery | 715-744 |
2018 | eurocrypt | Updatable Encryption with Post-Compromise Security | 685-716 |
2018 | eurocrypt | Exploring the Boundaries of Topology-Hiding Computation | 294-325 |
2018 | eurocrypt | An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge | 66-87 |
2018 | eurocrypt | Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions | 535-564 |
2018 | eurocrypt | Homomorphic Lower Digits Removal and Improved FHE Bootstrapping | 315-337 |
2018 | eurocrypt | Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus | 174-203 |
2018 | eurocrypt | The Communication Complexity of Private Simultaneous Messages, Revisited | 261-286 |
2018 | eurocrypt | Thunderella: Blockchains with Optimistic Instant Confirmation | 3-33 |
2018 | eurocrypt | Adaptively Secure Garbling with Near Optimal Online Complexity | 535-565 |
2018 | eurocrypt | Obfustopia Built on Secret-Key Functional Encryption | 603-648 |
2018 | eurocrypt | Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange | 425-455 |
2018 | eurocrypt | Two-Round Multiparty Secure Computation from Minimal Assumptions | 468-499 |
2018 | eurocrypt | Optimal Forgeries Against Polynomial-Based MACs and GCM | 445-467 |
2018 | eurocrypt | Random Oracles and Non-uniformity | 227-258 |
2018 | eurocrypt | OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks | 456-486 |
2018 | eurocrypt | Masking the GLP Lattice-Based Signature Scheme at Any Order | 354-384 |
2018 | eurocrypt | Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs | 222-255 |
2018 | eurocrypt | Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation | 259-279 |
2018 | eurocrypt | Overdrive: Making SPDZ Great Again | 158-189 |
2018 | eurocrypt | A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model | 552-586 |
2018 | eurocrypt | Masking Proofs Are Tight and How to Exploit it in Security Evaluations | 385-412 |
2018 | eurocrypt | Towards Breaking the Exponential Barrier for General Secret Sharing | 567-596 |
2018 | eurocrypt | Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions | 162-194 |
2018 | eurocrypt | An Improved Affine Equivalence Algorithm for Random Permutations | 413-442 |
2018 | eurocrypt | More Efficient (Almost) Tightly Secure Structure-Preserving Signatures | 230-258 |
2018 | eurocrypt | Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge | 193-221 |
2018 | eurocrypt | Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption | 91-122 |
2018 | eurocrypt | Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing | 597-621 |
2018 | eurocrypt | On the Gold Standard for Security of Universal Steganography | 29-60 |
2018 | eurocrypt | Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions | 329-368 |
2018 | eurocrypt | The Wonderful World of Global Random Oracles | 280-312 |
2018 | eurocrypt | The Complexity of Multiparty PSM Protocols and Related Models | 287-318 |
2018 | eurocrypt | Fuzzy Password-Authenticated Key Exchange | 393-424 |
2018 | eurocrypt | Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds | 468-499 |
2018 | eurocrypt | Fast Near Collision Attack on the Grain v1 Stream Cipher | 771-802 |
2018 | eurocrypt | Synchronized Aggregate Signatures from the RSA Assumption | 197-229 |
2018 | eurocrypt | Naor-Reingold Goes Public: The Complexity of Known-Key Security | 653-684 |
2018 | eurocrypt | Unbounded ABE via Bilinear Entropy Expansion, Revisited | 503-534 |
2018 | eurocrypt | Statistical Witness Indistinguishability (and more) in Two Messages | 34-65 |
2018 | eurocrypt | Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II | |
2018 | eurocrypt | Shortest Vector from Lattice Sieving: A Few Dimensions for Free | 125-145 |
2018 | eurocrypt | The Discrete-Logarithm Problem with Preprocessing | 415-447 |
2018 | eurocrypt | Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I | |
2018 | eurocrypt | Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III | |
2018 | eurocrypt | Formal Verification of Masked Hardware Implementations in the Presence of Glitches | 321-353 |
2018 | eurocrypt | On the Bit Security of Cryptographic Primitives | 3-28 |
2018 | fse | On breaking SHA-1 | |
2018 | jofc | On the Feasibility of Extending Oblivious Transfer | 737-773 |
2018 | jofc | Asymptotically Efficient Lattice-Based Digital Signatures | 774-797 |
2018 | jofc | Completeness for Symmetric Two-Party Functionalities: Revisited | 671-697 |
2018 | jofc | Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression | 885-916 |
2018 | jofc | Key-Recovery Attacks on ASASA | 845-884 |
2018 | jofc | Fast Garbling of Circuits Under Standard Assumptions | 798-844 |
2018 | jofc | Efficient Slide Attacks | 641-670 |
2018 | jofc | Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance | 610-640 |
2018 | jofc | On Constructing One-Way Permutations from Indistinguishability Obfuscation | 698-736 |
2018 | jofc | Practical Cryptanalysis of Bluetooth Encryption with Condition Masking | 394-433 |
2018 | jofc | Multivariate High-Order Attacks of Shuffled Tables Recomputation | 351-393 |
2018 | jofc | All-But-Many Encryption | 226-275 |
2018 | jofc | Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings | 1-22 |
2018 | jofc | Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs | 537-586 |
2018 | jofc | A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption | 172-201 |
2018 | jofc | Characterization of Secure Multiparty Computation Without Broadcast | 587-609 |
2018 | jofc | Making the Impossible Possible | 101-133 |
2018 | jofc | Practical Homomorphic Message Authenticators for Arithmetic Circuits | 23-59 |
2018 | jofc | How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? | 162-171 |
2018 | jofc | Robust Encryption | 307-350 |
2018 | jofc | Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions | 60-100 |
2018 | jofc | Optimal Security Proofs for Full Domain Hash, Revisited | 276-306 |
2018 | jofc | Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions | 434-520 |
2018 | jofc | Incremental Deterministic Public-Key Encryption | 134-161 |
2018 | jofc | Function-Private Functional Encryption in the Private-Key Setting | 202-225 |
2018 | jofc | Deterministic Encryption with the Thorp Shuffle | 521-536 |
2018 | pkc | Oblivious Pseudo-Random Functions and Their Applications to Password Protocols | |
2018 | pkc | How (and Why) to Compute on Secret-Shared Values | |
2018 | pkc | New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes | 3-31 |
2018 | pkc | Related Randomness Security for Public Key Encryption, Revisited | 280-311 |
2018 | pkc | Subversion-Zero-Knowledge SNARKs | 315-347 |
2018 | pkc | Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups | 348-377 |
2018 | pkc | A Practical Cryptanalysis of WalnutDSA$$^{\text {TM}}$$TM | 381-406 |
2018 | pkc | Speed-Ups and Time–Memory Trade-Offs for Tuple Lattice Sieving | 407-436 |
2018 | pkc | Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem | 437-460 |
2018 | pkc | Reusing Tamper-Proof Hardware in UC-Secure Protocols | 463-493 |
2018 | pkc | On Composable Security for Digital Signatures | 494-523 |
2018 | pkc | Equational Security Proofs of Oblivious Transfer Protocols | 527-553 |
2018 | pkc | Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs | 554-583 |
2018 | pkc | Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption | 32-61 |
2018 | pkc | Committed MPC | 587-619 |
2018 | pkc | Fast Garbling of Circuits over 3-Valued Logic | 620-643 |
2018 | pkc | Efficient Covert Two-Party Computation | 644-674 |
2018 | pkc | Towards Characterizing Securely Computable Two-Party Randomized Functions | 675-697 |
2018 | pkc | On the Message Complexity of Secure Multiparty Computation | 698-711 |
2018 | pkc | Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions | 62-92 |
2018 | pkc | Multi-Key Searchable Encryption, Revisited | 95-124 |
2018 | pkc | Fully Homomorphic Encryption from the Finite Field Isomorphism Problem | 125-155 |
2018 | pkc | Hybrid Encryption in a Multi-user Setting, Revisited | 159-189 |
2018 | pkc | KEM Combiners | 190-218 |
2018 | pkc | Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications | 219-250 |
2018 | pkc | Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures | 253-279 |
2018 | pkc | SOFIA: $$\mathcal {MQ}$$MQ-Based Signatures in the QROM | 3-33 |
2018 | pkc | Local Non-malleable Codes in the Bounded Retrieval Model | 281-311 |
2018 | pkc | Non-malleability vs. CCA-Security: The Case of Commitments | 312-337 |
2018 | pkc | Interactively Secure Groups from Obfuscation | 341-370 |
2018 | pkc | Graded Encoding Schemes from Obfuscation | 371-400 |
2018 | pkc | Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli | 403-430 |
2018 | pkc | Two-Factor Authentication with End-to-End Password Security | 431-461 |
2018 | pkc | Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup | 465-495 |
2018 | pkc | Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits | 499-529 |
2018 | pkc | Compact Zero-Knowledge Proofs of Small Hamming Weight | 530-560 |
2018 | pkc | Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials | 561-588 |
2018 | pkc | A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures | 34-57 |
2018 | pkc | On the Security of Classic Protocols for Unique Witness Relations | 589-615 |
2018 | pkc | New (and Old) Proof Systems for Lattice Problems | 619-643 |
2018 | pkc | Hash Proof Systems over Lattices Revisited | 644-674 |
2018 | pkc | Privately Constraining and Programming PRFs, the LWE Way | 675-701 |
2018 | pkc | Learning with Errors and Extrapolated Dihedral Cosets | 702-727 |
2018 | pkc | Rounded Gaussians | 728-757 |
2018 | pkc | Constant-Size Group Signatures from Lattices | 58-88 |
2018 | pkc | Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices | 89-119 |
2018 | pkc | Improved (Almost) Tightly-Secure Structure-Preserving Signatures | 123-152 |
2018 | pkc | Weakly Secure Equivalence-Class Signatures from Standard Assumptions | 153-183 |
2018 | pkc | Simple and Generic Constructions of Succinct Functional Encryption | 187-217 |
2018 | pkc | Making Public Key Functional Encryption Function Private, Distributively | 218-244 |
2018 | pkc | Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption | 245-277 |
2018 | tcc | Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries | 3-32 |
2018 | tcc | Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations | 263-285 |
2018 | tcc | Round Optimal Black-Box “Commit-and-Prove” | 286-313 |
2018 | tcc | On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate | 317-344 |
2018 | tcc | Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio | 345-369 |
2018 | tcc | Information-Theoretic Broadcast with Dishonest Majority for Long Messages | 370-388 |
2018 | tcc | Oblivious Transfer in Incomplete Networks | 389-418 |
2018 | tcc | Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier? | 421-447 |
2018 | tcc | Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations | 448-475 |
2018 | tcc | Certifying Trapdoor Permutations, Revisited | 476-506 |
2018 | tcc | On the Security Loss of Unique Signatures | 507-536 |
2018 | tcc | Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time | 33-66 |
2018 | tcc | On the Complexity of Fair Coin Flipping | 539-562 |
2018 | tcc | Game Theoretic Notions of Fairness in Multi-party Coin Toss | 563-596 |
2018 | tcc | Achieving Fair Treatment in Algorithmic Classification | 597-625 |
2018 | tcc | Upgrading to Functional Encryption | 629-658 |
2018 | tcc | Impossibility of Simulation Secure Functional Encryption Even with Random Oracles | 659-688 |
2018 | tcc | Registration-Based Encryption: Removing Private-Key Generator from IBE | 689-718 |
2018 | tcc | No-signaling Linear PCPs | 67-97 |
2018 | tcc | On Basing Search SIVP on NP-Hardness | 98-119 |
2018 | tcc | Two-Round MPC: Information-Theoretic and Black-Box | 123-151 |
2018 | tcc | Perfect Secure Computation in Two Rounds | 152-174 |
2018 | tcc | Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions | 175-205 |
2018 | tcc | One-Message Zero Knowledge and Non-malleable Commitments | 209-234 |
2018 | tcc | Smooth NIZK Arguments | 235-262 |
2018 | tcc | Topology-Hiding Computation Beyond Semi-Honest Adversaries | 3-35 |
2018 | tcc | Best Possible Information-Theoretic MPC | 255-281 |
2018 | tcc | Secure Certification of Mixed Quantum States with Application to Two-Party Randomness Generation | 282-314 |
2018 | tcc | Classical Proofs for the Quantum Collapsing Property of Classical Hash Functions | 315-338 |
2018 | tcc | Traitor-Tracing from LWE Made Simple and Attribute-Based | 341-369 |
2018 | tcc | Two-Message Statistically Sender-Private OT from LWE | 370-390 |
2018 | tcc | Adaptively Secure Distributed PRFs from $$\mathsf {LWE}$$ | 391-421 |
2018 | tcc | A Simple Construction of iO for Turing Machines | 425-454 |
2018 | tcc | Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm | 455-472 |
2018 | tcc | FE and iO for Turing Machines from Minimal Assumptions | 473-512 |
2018 | tcc | The MMap Strikes Back: Obfuscation and New Multilinear Maps Immune to CLT13 Zeroizing Attacks | 513-543 |
2018 | tcc | Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions) | 36-65 |
2018 | tcc | Return of GGH15: Provable Security Against Zeroizing Attacks | 544-574 |
2018 | tcc | The Security of Lazy Users in Out-of-Band Authentication | 575-599 |
2018 | tcc | Is There an Oblivious RAM Lower Bound for Online Reads? | 603-635 |
2018 | tcc | Perfectly Secure Oblivious Parallel RAM | 636-668 |
2018 | tcc | Watermarking PRFs Under Standard Assumptions: Public Marking and Security with Extraction Queries | 669-698 |
2018 | tcc | Exploring Crypto Dark Matter: | 699-729 |
2018 | tcc | Fine-Grained Secure Computation | 66-97 |
2018 | tcc | On the Structure of Unconditional UC Hybrid Protocols | 98-126 |
2018 | tcc | Impossibility of Order-Revealing Encryption in Idealized Models | 129-158 |
2018 | tcc | A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage | 159-176 |
2018 | tcc | Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound | 177-191 |
2018 | tcc | Towards Tight Security of Cascaded LRW2 | 192-222 |
2018 | tcc | Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments | 225-254 |
2018 | tcc | Search Problems: A Cryptographic Perspective | |
2018 | tcc | Encrypted Computation | |
2018 | tches | Preface to TCHES 2018 | online |
2018 | tches | FPGA-based Accelerator for Post-Quantum Signature Scheme SPHINCS-256 | online |
2018 | tches | High Order Masking of Look-up Tables with Common Shares | online |
2018 | tches | A Cautionary Note When Looking for a Truly Reconfigurable Resistive RAM PUF | online |
2018 | tches | EM Analysis in the IoT Context: Lessons Learned from an Attack on Thread | online |
2018 | tches | Stealthy Opaque Predicates in Hardware - Obfuscating Constant Expressions at Negligible Overhead | online |
2018 | tches | Dismantling the AUT64 Automotive Cipher | online |
2018 | tches | Generic Low-Latency Masking in Hardware | online |
2018 | tches | CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme | online |
2018 | tches | Fast FPGA Implementations of Diffie-Hellman on the Kummer Surface of a Genus-2 Curve | online |
2018 | tches | Hardware Masking, Revisited | online |
2018 | tches | Mixing Additive and Multiplicative Masking for Probing Secure Polynomial Evaluation Methods | online |
2018 | tches | Smashing the Implementation Records of AES S-box | online |
2018 | tches | High-Performance FV Somewhat Homomorphic Encryption on GPUs: An Implementation using CUDA | online |
2018 | tches | Rhythmic Keccak: SCA Security and Low Latency in HW | online |
2018 | tches | CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks | online |
2018 | tches | Practical CCA2-Secure and Masked Ring-LWE Implementation | online |
2018 | tches | ExpFault: An Automated Framework for Exploitable Fault Characterization in Block Ciphers | online |
2018 | tches | Attacking GlobalPlatform SCP02-compliant Smart Cards Using a Padding Oracle Attack | online |
2018 | tches | Beetle Family of Lightweight and Secure Authenticated Encryption Ciphers | online |
2018 | tches | Improved High-Order Conversion From Boolean to Arithmetic Masking | online |
2018 | tches | Fault Attacks Made Easy: Differential Fault Analysis Automation on Assembly Code | online |
2018 | tches | Linear Repairing Codes and Side-Channel Attacks | online |
2018 | tches | Leakage Detection with the x2-Test | online |
2018 | tches | SAEB: A Lightweight Blockcipher-Based AEAD Mode of Operation | online |
2018 | tches | SIDH on ARM: Faster Modular Multiplications for Faster Post-Quantum Supersingular Isogeny Key Exchange | online |
2018 | tches | Composable Masking Schemes in the Presence of Physical Defaults & the Robust Probing Model | online |
2018 | tches | On Recovering Affine Encodings in White-Box Implementations | online |
2018 | tches | FACE: Fast AES CTR mode Encryption Techniques based on the Reuse of Repetitive Data | online |
2018 | tches | Side-Channel Attacks on Post-Quantum Signature Schemes based on Multivariate Quadratic Equations - Rainbow and UOV - | online |
2018 | tches | New Bleichenbacher Records: Fault Attacks on qDSA Signatures | online |
2018 | tches | Saber on ARM CCA-secure module lattice-based key encapsulation on ARM | online |
2018 | tches | Extending Glitch-Free Multiparty Protocols to Resist Fault Injection Attacks | online |
2018 | tches | Efficient Side-Channel Protections of ARX Ciphers | online |
2018 | tches | Data Flow Oriented Hardware Design of RNS-based Polynomial Multiplication for SHE Acceleration | online |
2018 | tches | Key Extraction Using Thermal Laser Stimulation A Case Study on Xilinx Ultrascale FPGAs | online |
2018 | tches | FPGAhammer: Remote Voltage Fault Attacks on Shared FPGAs, suitable for DFA on AES | online |
2018 | tches | Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness | online |
2018 | tches | SIFA: Exploiting Ineffective Fault Inductions on Symmetric Cryptography | online |
2018 | tches | Multiplicative Masking for AES in Hardware | online |
2018 | tches | On the Difficulty of FSM-based Hardware Obfuscation | online |
2018 | tches | Cold Boot Attacks on Ring and Module LWE Keys Under the NTT | online |
2018 | tches | Preface to TCHES 2018 | online |
2018 | tches | ES-TRNG: A High-throughput, Low-area True Random Number Generator based on Edge Sampling | online |
2018 | tches | Differential Fault Attacks on Deterministic Lattice Signatures | online |
2018 | tches | Persistent Fault Analysis on Block Ciphers | online |
2018 | tches | Spin Me Right Round Rotational Symmetry for FPGA-Specific AES | online |
2018 | tches | Low Randomness Masking and Shuffling: An Evaluation Using Mutual Information | online |
2018 | tches | Standard Lattice-Based Key Encapsulation on Embedded Devices | online |
2018 | tosc | Towards Low Energy Stream Ciphers | online |
2018 | tosc | ShiftRows Alternatives for AES-like Ciphers and Optimal Cell Permutations for Midori and Skinny | online |
2018 | tosc | MDS Matrices with Lightweight Circuits | online |
2018 | tosc | Separable Statistics and Multidimensional Linear Cryptanalysis | online |
2018 | tosc | Clustering Related-Tweak Characteristics: Application to MANTIS-6 | online |
2018 | tosc | Mixture Differential Cryptanalysis: a New Approach to Distinguishers and Attacks on round-reduced AES | online |
2018 | tosc | Cryptanalysis of AES-PRF and Its Dual | online |
2018 | tosc | SUNDAE: Small Universal Deterministic Authenticated Encryption for the Internet of Things | online |
2018 | tosc | Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF | online |
2018 | tosc | More Accurate Differential Properties of LED64 and Midori64 | online |
2018 | tosc | Cryptanalysis of Reduced round SKINNY Block Cipher | online |
2018 | tosc | Cryptanalysis of Low-Data Instances of Full LowMCv2 | online |
2018 | tosc | Cube-Attack-Like Cryptanalysis of Round-Reduced Keccak Using MILP | online |
2018 | tosc | Conditional Linear Cryptanalysis – Cryptanalysis of DES with Less Than 242 Complexity | online |
2018 | tosc | Generating Graphs Packed with Paths Estimation of Linear Approximations and Differentials | online |
2018 | tosc | On the Boomerang Uniformity of Cryptographic Sboxes | online |
2018 | tosc | Lightweight and Side-channel Secure 4 × 4 S-Boxes from Cellular Automata Rules | online |
2018 | tosc | The design of Xoodoo and Xoofff | online |
2018 | tosc | Adiantum: length-preserving encryption for entry-level processors | online |
2018 | tosc | Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants | online |
2018 | tosc | Nonlinear Approximations in Cryptanalysis Revisited | online |
2018 | tosc | New Yoyo Tricks with AES-based Permutations | online |
2018 | tosc | Key Prediction Security of Keyed Sponges | online |
2018 | tosc | Key Assignment Scheme with Authenticated Encryption | online |
2018 | tosc | Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers | online |
2018 | tosc | Revisiting Variable Output Length XOR Pseudorandom Function | online |
2018 | tosc | Multivariate Profiling of Hulls for Linear Cryptanalysis | online |
2018 | tosc | Searching for Subspace Trails and Truncated Differentials | online |
2018 | tosc | On the Generalization of Butterfly Structure | online |
2018 | tosc | On Efficient Constructions of Lightweight MDS Matrices | online |
2018 | tosc | Column Parity Mixers | online |
2018 | tosc | Frequency-smoothing encryption: preventing snapshot attacks on deterministically encrypted data | online |
2018 | tosc | Distinguishing Attack on NORX Permutation | online |
2018 | tosc | Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions | online |
2018 | tosc | Revisiting and Improving Algorithms for the 3XOR Problem | online |
2018 | tosc | Key-Recovery Attacks on Full Kravatte | online |
2018 | tosc | State-Recovery Attacks on Modified Ketje Jr | online |
2018 | tosc | Short Non-Malleable Codes from Related-Key Secure Block Ciphers | online |
2018 | tosc | Preface to Volume 2018, Issue 1 | online |