year |
venue |
title |
pages |
2019 | asiacrypt | Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey) | 3-17 |
2019 | asiacrypt | Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes | 21-51 |
2019 | asiacrypt | Middle-Product Learning with Rounding Problem and Its Applications | 55-81 |
2019 | asiacrypt | A Novel CCA Attack Using Decryption Errors Against LAC | 82-111 |
2019 | asiacrypt | Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More | 112-141 |
2019 | asiacrypt | 4-Round Luby-Rackoff Construction is a qPRP | 145-174 |
2019 | asiacrypt | Indifferentiability of Truncated Random Permutations | 175-195 |
2019 | asiacrypt | Anomalies and Vector Space Search: Tools for S-Box Analysis | 196-223 |
2019 | asiacrypt | CSI-FiSh: Efficient Isogeny Based Signatures Through Class Group Computations | 227-247 |
2019 | asiacrypt | Verifiable Delay Functions from Supersingular Isogenies and Pairings | 248-277 |
2019 | asiacrypt | Strongly Secure Authenticated Key Exchange from Supersingular Isogenies | 278-308 |
2019 | asiacrypt | Dual-Mode NIZKs from Obfuscation | 311-341 |
2019 | asiacrypt | Output Compression, MPC, and iO for Turing Machines | 342-370 |
2019 | asiacrypt | Collusion Resistant Watermarking Schemes for Cryptographic Functionalities | 371-398 |
2019 | asiacrypt | Valiant’s Universal Circuits Revisited: An Overall Improvement and a Lower Bound | 401-425 |
2019 | asiacrypt | The Broadcast Message Complexity of Secure Multiparty Computation | 426-455 |
2019 | asiacrypt | Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation | 456-487 |
2019 | asiacrypt | Card-Based Cryptography Meets Formal Verification | 488-517 |
2019 | asiacrypt | Quantum Algorithms for the Approximate k-List Problem and Their Application to Lattice Sieving | 521-551 |
2019 | asiacrypt | Quantum Attacks Without Superposition Queries: The Offline Simon’s Algorithm | 552-583 |
2019 | asiacrypt | Quantum Random Oracle Model with Auxiliary Input | 584-614 |
2019 | asiacrypt | QFactory: Classically-Instructed Remote Secret Qubits Preparation | 615-645 |
2019 | asiacrypt | Quisquis: A New Design for Anonymous Cryptocurrencies | 649-678 |
2019 | asiacrypt | Divisible E-Cash from Constrained Pseudo-Random Functions | 679-708 |
2019 | asiacrypt | Collision Resistant Hashing from Sub-exponential Learning Parity with Noise | 3-24 |
2019 | asiacrypt | New Code-Based Privacy-Preserving Cryptographic Constructions | 25-55 |
2019 | asiacrypt | An LLL Algorithm for Module Lattices | 59-90 |
2019 | asiacrypt | Order-LWE and the Hardness of Ring-LWE with Entropic Secrets | 91-120 |
2019 | asiacrypt | On the Non-existence of Short Vectors in Random Module Lattices | 121-150 |
2019 | asiacrypt | Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages | 153-182 |
2019 | asiacrypt | Anonymous AE | 183-208 |
2019 | asiacrypt | Sponges Resist Leakage: The Case of Authenticated Encryption | 209-240 |
2019 | asiacrypt | Dual Isogenies and Their Application to Public-Key Compression for Isogeny-Based Cryptography | 243-272 |
2019 | asiacrypt | Optimized Method for Computing Odd-Degree Isogenies on Edwards Curves | 273-292 |
2019 | asiacrypt | Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion | 293-322 |
2019 | asiacrypt | On Kilian’s Randomization of Multilinear Map Encodings | 325-355 |
2019 | asiacrypt | Cryptanalysis of CLT13 Multilinear Maps with Independent Slots | 356-385 |
2019 | asiacrypt | Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps | 386-412 |
2019 | asiacrypt | Numerical Method for Comparison on Homomorphically Encrypted Numbers | 415-445 |
2019 | asiacrypt | Multi-Key Homomorphic Encryption from TFHE | 446-472 |
2019 | asiacrypt | Homomorphic Encryption for Finite Automata | 473-502 |
2019 | asiacrypt | Efficient Explicit Constructions of Multipartite Secret Sharing Schemes | 505-536 |
2019 | asiacrypt | Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead | 537-563 |
2019 | asiacrypt | How to Correct Errors in Multi-server PIR | 564-574 |
2019 | asiacrypt | UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens | 577-605 |
2019 | asiacrypt | Efficient UC Commitment Extension with Homomorphism for Free (and Applications) | 606-635 |
2019 | asiacrypt | Scalable Private Set Union from Symmetric-Key Techniques | 636-666 |
2019 | asiacrypt | Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures | 3-32 |
2019 | asiacrypt | Decisional Second-Preimage Resistance: When Does SPR Imply PRE? | 33-62 |
2019 | asiacrypt | Structure-Preserving Signatures on Equivalence Classes from Standard Assumptions | 63-93 |
2019 | asiacrypt | Simple and Efficient KDM-CCA Secure Public Key Encryption | 97-127 |
2019 | asiacrypt | Non-Committing Encryption with Quasi-Optimal Ciphertext-Rate Based on the DDH Problem | 128-158 |
2019 | asiacrypt | Structure-Preserving and Re-randomizable RCCA-Secure Public Key Encryption and Its Applications | 159-190 |
2019 | asiacrypt | iUC: Flexible Universal Composability Made Simple | 191-221 |
2019 | asiacrypt | Leakage Resilience of the Duplex Construction | 225-255 |
2019 | asiacrypt | A Critical Analysis of ISO 17825 (‘Testing Methods for the Mitigation of Non-invasive Attack Classes Against Cryptographic Modules’) | 256-284 |
2019 | asiacrypt | Location, Location, Location: Revisiting Modeling and Exploitation for Location-Based Side Channel Leakages | 285-314 |
2019 | asiacrypt | Simple Refreshing in the Noisy Leakage Model | 315-344 |
2019 | asiacrypt | The Exchange Attack: How to Distinguish Six Rounds of AES with $$2^{88.2}$$Chosen Plaintexts | 347-370 |
2019 | asiacrypt | Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC | 371-397 |
2019 | asiacrypt | MILP-aided Method of Searching Division Property Using Three Subsets and Applications | 398-427 |
2019 | asiacrypt | Cryptanalysis of GSM Encryption in 2G/3G Networks Without Rainbow Tables | 428-456 |
2019 | asiacrypt | Tightly Secure Inner Product Functional Encryption: Multi-input and Function-Hiding Constructions | 459-488 |
2019 | asiacrypt | Public-Key Function-Private Hidden Vector Encryption (and More) | 489-519 |
2019 | asiacrypt | Multi-Client Functional Encryption for Linear Functions in the Standard Model from LWE | 520-551 |
2019 | asiacrypt | From Single-Input to Multi-client Inner-Product Functional Encryption | 552-582 |
2019 | asiacrypt | Rate-1 Trapdoor Functions from the Diffie-Hellman Problem | 585-606 |
2019 | asiacrypt | The Local Forking Lemma and Its Application to Deterministic Encryption | 607-636 |
2019 | asiacrypt | Fine-Grained Cryptography Revisited | 637-666 |
2019 | asiacrypt | Shorter QA-NIZK and SPS with Tighter Security | 669-699 |
2019 | asiacrypt | Efficient Noninteractive Certification of RSA Moduli and Beyond | 700-727 |
2019 | asiacrypt | Shorter Pairing-Based Arguments Under Standard Assumptions | 728-757 |
2019 | asiacrypt | New proof systems for sustainable blockchains: proofs of space and verifiable delay functions | |
2019 | asiacrypt | Streamlined blockchains: A simple and elegant approach (tutorial) | |
2019 | ches | RISCV and Security: how, when and why? | |
2019 | ches | Developing High-Performance Mechanically-Verified Cryptographic Code | |
2019 | crypto | Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality | 3-31 |
2019 | crypto | Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE | 32-61 |
2019 | crypto | Fully Secure Attribute-Based Encryption for t-CNF from LWE | 62-85 |
2019 | crypto | Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors | 89-114 |
2019 | crypto | Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications | 115-146 |
2019 | crypto | Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications | 147-175 |
2019 | crypto | Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs | 176-202 |
2019 | crypto | Seedless Fruit Is the Sweetest: Random Number Generation, Revisited | 205-234 |
2019 | crypto | Nonces Are Noticed: AEAD Revisited | 235-265 |
2019 | crypto | How to Build Pseudorandom Functions from Public Random Permutations | 266-293 |
2019 | crypto | New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator | 297-321 |
2019 | crypto | On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm | 322-351 |
2019 | crypto | Proofs of Replicated Storage Without Timing Assumptions | 355-380 |
2019 | crypto | Simple Proofs of Space-Time and Rational Proofs of Storage | 381-409 |
2019 | crypto | Non-malleable Codes for Decision Trees | 413-434 |
2019 | crypto | Explicit Rate-1 Non-malleable Codes for Local Tampering | 435-466 |
2019 | crypto | Continuous Space-Bounded Non-malleable Codes from Stronger Proofs-of-Space | 467-495 |
2019 | crypto | Synchronous, with a Chance of Partition Tolerance | 499-529 |
2019 | crypto | Subvector Commitments with Application to Succinct Arguments | 530-560 |
2019 | crypto | Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains | 561-586 |
2019 | crypto | On the Plausibility of Fully Homomorphic Encryption for RAMs | 589-619 |
2019 | crypto | Homomorphic Time-Lock Puzzles and Applications | 620-649 |
2019 | crypto | Symmetric Primitives with Structured Secrets | 650-679 |
2019 | crypto | Unifying Leakage Models on a Rényi Day | 683-712 |
2019 | crypto | Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations | 713-737 |
2019 | crypto | Security in the Presence of Key Reuse: Context-Separable Interfaces and Their Applications | 738-768 |
2019 | crypto | The Communication Complexity of Threshold Private Set Intersection | 3-29 |
2019 | crypto | Adaptively Secure MPC with Sublinear Communication Complexity | 30-60 |
2019 | crypto | Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing | 61-84 |
2019 | crypto | Communication-Efficient Unconditional MPC with Guaranteed Output Delivery | 85-114 |
2019 | crypto | Efficient Collision Attack Frameworks for RIPEMD-160 | 117-149 |
2019 | crypto | Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning | 150-179 |
2019 | crypto | Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full $$\mathsf {MORUS}$$ | 180-209 |
2019 | crypto | Low-Memory Attacks Against Two-Round Even-Mansour Using the 3-XOR Problem | 210-235 |
2019 | crypto | How to Record Quantum Queries, and Applications to Quantum Indifferentiability | 239-268 |
2019 | crypto | Quantum Security Proofs Using Semi-classical Oracles | 269-295 |
2019 | crypto | Quantum Indistinguishability of Random Sponges | 296-325 |
2019 | crypto | Revisiting Post-quantum Fiat-Shamir | 326-355 |
2019 | crypto | Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model | 356-383 |
2019 | crypto | Unconditionally Secure Computation Against Low-Complexity Leakage | 387-416 |
2019 | crypto | Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System | 417-447 |
2019 | crypto | Non-malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate | 448-479 |
2019 | crypto | Leakage Resilient Secret Sharing and Applications | 480-509 |
2019 | crypto | Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures | 510-539 |
2019 | crypto | Memory-Hard Functions from Cryptographic Primitives | 543-572 |
2019 | crypto | Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions | 573-607 |
2019 | crypto | Simultaneous Amplification: The Case of Non-interactive Zero-Knowledge | 608-637 |
2019 | crypto | The Privacy Blanket of the Shuffle Model | 638-667 |
2019 | crypto | Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption | 671-700 |
2019 | crypto | Match Me if You Can: Matchmaking Encryption and Its Applications | 701-731 |
2019 | crypto | ABE for DFA from k-Lin | 732-764 |
2019 | crypto | Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE | 765-797 |
2019 | crypto | The Distinction Between Fixed and Random Generators in Group-Based Assumptions | 801-830 |
2019 | crypto | Unifying Computational Entropies via Kullback–Leibler Divergence | 831-858 |
2019 | crypto | Trapdoor Hash Functions and Their Applications | 3-32 |
2019 | crypto | CCA Security and Trapdoor Functions via Key-Dependent-Message Security | 33-64 |
2019 | crypto | Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs | 67-97 |
2019 | crypto | Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge | 98-127 |
2019 | crypto | On Round Optimal Statistical Zero Knowledge Arguments | 128-156 |
2019 | crypto | It Wasn’t Me! | 159-190 |
2019 | crypto | Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations | 191-221 |
2019 | crypto | Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption | 222-250 |
2019 | crypto | Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map | 253-283 |
2019 | crypto | Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification | 284-332 |
2019 | crypto | Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs | 335-366 |
2019 | crypto | Watermarking Public-Key Cryptographic Primitives | 367-398 |
2019 | crypto | SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension | 401-431 |
2019 | crypto | Universally Composable Secure Computation with Corrupted Tokens | 432-461 |
2019 | crypto | Reusable Non-Interactive Secure Computation | 462-488 |
2019 | crypto | Efficient Pseudorandom Correlation Generators: Silent OT Extension and More | 489-518 |
2019 | crypto | Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously | 521-551 |
2019 | crypto | Non-interactive Non-malleability from Quantum Supremacy | 552-582 |
2019 | crypto | Cryptographic Sensing | 583-604 |
2019 | crypto | Public-Key Cryptography in the Fine-Grained Setting | 605-635 |
2019 | crypto | Exploring Constructions of Compact NIZKs from Various Assumptions | 639-669 |
2019 | crypto | New Constructions of Reusable Designated-Verifier NIZKs | 670-700 |
2019 | crypto | Scalable Zero Knowledge with No Trusted Setup | 701-732 |
2019 | crypto | Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation | 733-764 |
2019 | crypto | Highly Efficient Key Exchange Protocols with Optimal Tightness | 767-797 |
2019 | crypto | Strong Asymmetric PAKE Based on Trapdoor CKEM | 798-825 |
2019 | crypto | Broadcast and Trace with
$$N^{\varepsilon }$$
Ciphertext Size from Standard Assumptions | 826-855 |
2019 | crypto | Secure computation: When theory meets... | |
2019 | crypto | Contextual Integrity | |
2019 | eurocrypt | Towards an Open Approach to Secure Cryptographic Implementations | |
2019 | eurocrypt | Fully Homomorphic Encryption from the Ground Up | |
2019 | eurocrypt | Compact Adaptively Secure ABE for $$\mathsf {NC^1}$$ from k-Lin | 3-33 |
2019 | eurocrypt | Unbounded Dynamic Predicate Compositions in Attribute-Based Encryption | 34-67 |
2019 | eurocrypt | (R)CCA Secure Updatable Encryption with Integrity Protection | 68-99 |
2019 | eurocrypt | Aurora: Transparent Succinct Arguments for R1CS | 103-128 |
2019 | eurocrypt | The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol | 129-158 |
2019 | eurocrypt | Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging | 159-188 |
2019 | eurocrypt | Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation | 191-225 |
2019 | eurocrypt | Sum-of-Squares Meets Program Obfuscation, Revisited | 226-250 |
2019 | eurocrypt | How to Leverage Hardness of Constant-Degree Expanding Polynomials over $$\mathbb {R}$$R to build $$i\mathcal {O}$$iO | 251-281 |
2019 | eurocrypt | XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields | 285-312 |
2019 | eurocrypt | DLCT: A New Tool for Differential-Linear Cryptanalysis | 313-342 |
2019 | eurocrypt | Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC | 343-372 |
2019 | eurocrypt | Distributed Differential Privacy via Shuffling | 375-403 |
2019 | eurocrypt | Lower Bounds for Differentially Private RAMs | 404-434 |
2019 | eurocrypt | Beyond Birthday Bound Secure MAC in Faulty Nonce Model | 437-466 |
2019 | eurocrypt | Tight Time-Memory Trade-Offs for Symmetric Encryption | 467-497 |
2019 | eurocrypt | Non-Malleable Codes Against Bounded Polynomial Time Tampering | 501-530 |
2019 | eurocrypt | Continuous Non-Malleable Codes in the 8-Split-State Model | 531-561 |
2019 | eurocrypt | Correlated-Source Extractors and Cryptography with Correlated-Random Tapes | 562-592 |
2019 | eurocrypt | Revisiting Non-Malleable Secret Sharing | 593-622 |
2019 | eurocrypt | Multi-party Virtual State Channels | 625-656 |
2019 | eurocrypt | Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble | 657-689 |
2019 | eurocrypt | Proof-of-Stake Protocols for Privacy-Aware Blockchains | 690-719 |
2019 | eurocrypt | Consensus Through Herding | 720-749 |
2019 | eurocrypt | Homomorphic Secret Sharing from Lattices Without FHE | 3-33 |
2019 | eurocrypt | Improved Bootstrapping for Approximate Homomorphic Encryption | 34-54 |
2019 | eurocrypt | Minicrypt Primitives with Algebraic Structure and Applications | 55-82 |
2019 | eurocrypt | Attacks only Get Better: How to Break FF3 on Large Domains | 85-116 |
2019 | eurocrypt | Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT | 117-150 |
2019 | eurocrypt | An Analysis of NIST SP 800-90A | 151-180 |
2019 | eurocrypt | Computationally Volume-Hiding Structured Encryption | 183-213 |
2019 | eurocrypt | Locality-Preserving Oblivious RAM | 214-243 |
2019 | eurocrypt | Private Anonymous Data Access | 244-273 |
2019 | eurocrypt | Reversible Proofs of Sequential Work | 277-291 |
2019 | eurocrypt | Incremental Proofs of Sequential Work | 292-323 |
2019 | eurocrypt | Tight Proofs of Space and Replication | 324-348 |
2019 | eurocrypt | Founding Secure Computation on Blockchains | 351-380 |
2019 | eurocrypt | Uncovering Algebraic Structures in the MPC Landscape | 381-406 |
2019 | eurocrypt | Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies | 409-441 |
2019 | eurocrypt | A Quantum-Proof Non-malleable Extractor | 442-469 |
2019 | eurocrypt | A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model | 473-503 |
2019 | eurocrypt | Degree 2 is Complete for the Round-Complexity of Malicious MPC | 504-531 |
2019 | eurocrypt | Two Round Information-Theoretic MPC with Malicious Security | 532-561 |
2019 | eurocrypt | Designated-Verifier Pseudorandom Generators, and Their Applications | 562-592 |
2019 | eurocrypt | Reusable Designated-Verifier NIZKs for all NP from CDH | 593-621 |
2019 | eurocrypt | Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions | 622-651 |
2019 | eurocrypt | Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More | 655-684 |
2019 | eurocrypt | Approx-SVP in Ideal Lattices with Pre-processing | 685-716 |
2019 | eurocrypt | The General Sieve Kernel and New Records in Lattice Reduction | 717-746 |
2019 | eurocrypt | Misuse Attacks on Post-quantum Cryptosystems | 747-776 |
2019 | eurocrypt | On ELFs, Deterministic Encryption, and Correlated-Input Security | 3-32 |
2019 | eurocrypt | New Techniques for Efficient Trapdoor Functions and Applications | 33-63 |
2019 | eurocrypt | Symbolic Encryption with Pseudorandom Keys | 64-93 |
2019 | eurocrypt | Covert Security with Public Verifiability: Faster, Leaner, and Simpler | 97-121 |
2019 | eurocrypt | Efficient Circuit-Based PSI with Linear Communication | 122-153 |
2019 | eurocrypt | An Algebraic Approach to Maliciously Secure Private Set Intersection | 154-185 |
2019 | eurocrypt | On Finding Quantum Multi-collisions | 189-218 |
2019 | eurocrypt | On Quantum Advantage in Information Theoretic Single-Server PIR | 219-246 |
2019 | eurocrypt | Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources | 247-277 |
2019 | eurocrypt | Ring Signatures: Logarithmic-Size, No Setup—from Standard Assumptions | 281-311 |
2019 | eurocrypt | Group Signatures Without NIZK: From Lattices in the Standard Model | 312-344 |
2019 | eurocrypt | A Modular Treatment of Blind Signatures from Identification Schemes | 345-375 |
2019 | eurocrypt | Efficient Verifiable Delay Functions | 379-407 |
2019 | eurocrypt | Quantum Lightning Never Strikes the Same State Twice | 408-438 |
2019 | eurocrypt | Secret-Sharing Schemes for General and Uniform Access Structures | 441-471 |
2019 | eurocrypt | Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary | 472-499 |
2019 | eurocrypt | Simple Schemes in the Bounded Storage Model | 500-524 |
2019 | eurocrypt | From Collisions to Chosen-Prefix Collisions Application to Full SHA-1 | 527-555 |
2019 | eurocrypt | Preimage Attacks on Round-Reduced Keccak-224/256 via an Allocating Approach | 556-584 |
2019 | eurocrypt | bison Instantiating the Whitened Swap-Or-Not Construction | 585-616 |
2019 | eurocrypt | Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing | 619-635 |
2019 | eurocrypt | New Techniques for Obfuscating Conjunctions | 636-666 |
2019 | eurocrypt | Distributional Collision Resistance Beyond One-Way Functions | 667-695 |
2019 | eurocrypt | Multi-target Attacks on the Picnic Signature Scheme and Related Protocols | 699-727 |
2019 | eurocrypt | Durandal: A Rank Metric Based Signature Scheme | 728-758 |
2019 | eurocrypt | SeaSign: Compact Isogeny Signatures from Class Group Actions | 759-789 |
2019 | eurocrypt | Differential Privacy and the People's Data | |
2019 | fse | On Invariant Attacks | |
2019 | fse | Preparing Symmetric Cryptography for the Quantum World | |
2019 | fse | Security of SHA-3 and Related Constructions | |
2019 | jofc | Blockcipher-Based Authenticated Encryption: How Small Can We Go? | |
2019 | jofc | On Black-Box Complexity of Universally Composable Security in the CRS Model | |
2019 | jofc | Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ | |
2019 | jofc | Multi-theorem Preprocessing NIZKs from Lattices | |
2019 | jofc | TFHE: Fast Fully Homomorphic Encryption Over the Torus | |
2019 | jofc | Constant-Round Maliciously Secure Two-Party Computation in the RAM Model | |
2019 | jofc | Cryptanalysis of the CLT13 Multilinear Map | 547-565 |
2019 | jofc | Hardness-Preserving Reductions via Cuckoo Hashing | 361-392 |
2019 | jofc | Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting | 265-323 |
2019 | jofc | (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens | 459-497 |
2019 | jofc | Four-State Non-malleable Codes with Explicit Constant Rate | |
2019 | jofc | Making Masking Security Proofs Concrete (Or How to Evaluate the Security of Any Leaking Device), Extended Version | 1263-1297 |
2019 | jofc | Updating Key Size Estimations for Pairings | 1298-1336 |
2019 | jofc | What Security Can We Achieve Within 4 Rounds? | 1200-1262 |
2019 | jofc | Fully Secure Functional Encryption with a Large Class of Relations from the Decisional Linear Assumption | 1491-1573 |
2019 | jofc | Classical Leakage Resilience from Fault-Tolerant Quantum Computation | 1071-1094 |
2019 | jofc | White-Box Cryptography: Don’t Forget About Grey-Box Attacks | 1095-1143 |
2019 | jofc | Small CRT-Exponent RSA Revisited | 1337-1382 |
2019 | jofc | Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications | 1448-1490 |
2019 | jofc | From Cryptomania to Obfustopia Through Secret-Key Functional Encryption | |
2019 | jofc | Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities | |
2019 | jofc | An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing | |
2019 | jofc | The Communication Complexity of Private Simultaneous Messages, Revisited | |
2019 | jofc | A Practical Forgery Attack on Lilliput-AE | |
2019 | jofc | Cryptanalytic Time–Memory–Data Trade-offs for FX-Constructions and the Affine Equivalence Problem | |
2019 | jofc | Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs | |
2019 | jofc | Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness | 941-972 |
2019 | jofc | Probabilistic Termination and Composability of Cryptographic Protocols | 690-741 |
2019 | jofc | The Magic of ELFs | 825-866 |
2019 | jofc | Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes | 895-940 |
2019 | jofc | Leakage Resilience from Program Obfuscation | 742-824 |
2019 | jofc | Efficient Fully Structure-Preserving Signatures and Shrinking Commitments | 973-1025 |
2019 | jofc | Key Establishment à la Merkle in a Quantum World | 601-634 |
2019 | jofc | Koblitz Curves over Quadratic Fields | 867-894 |
2019 | jofc | Generic Attacks on Hash Combiners | |
2019 | jofc | Feasibility and Infeasibility of Secure Computation with Malicious PUFs | |
2019 | jofc | From Minicrypt to Obfustopia via Private-Key Functional Encryption | |
2019 | jofc | Non-black-box Simulation in the Fully Concurrent Setting, Revisited | 393-434 |
2019 | jofc | Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials | 498-546 |
2019 | jofc | From Physical to Stochastic Modeling of a TERO-Based TRNG | 435-458 |
2019 | jofc | Automated Analysis of Cryptographic Assumptions in Generic Group Models | 324-360 |
2019 | jofc | On Tight Security Proofs for Schnorr Signatures | 566-599 |
2019 | jofc | Round-Efficient Black-Box Construction of Composable Multi-Party Computation | 178-238 |
2019 | jofc | On the Impossibility of Structure-Preserving Deterministic Primitives | 239-264 |
2019 | jofc | On the Tightness of Forward-Secure Signature Reductions | 84-150 |
2019 | jofc | Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem | 35-83 |
2019 | jofc | Multidimensional Linear Cryptanalysis | 1-34 |
2019 | jofc | Unifying Leakage Models: From Probing Attacks to Noisy Leakage | 151-177 |
2019 | pkc | Sub-logarithmic Distributed Oblivious RAM with Small Block Size | 3-33 |
2019 | pkc | Lossy Algebraic Filters with Short Tags | 34-65 |
2019 | pkc | Non-interactive Keyed-Verification Anonymous Credentials | 66-96 |
2019 | pkc | Shorter Ring Signatures from Standard Assumptions | 99-126 |
2019 | pkc | Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs | 127-158 |
2019 | pkc | Efficient Invisible and Unlinkable Sanitizable Signatures | 159-189 |
2019 | pkc | Group Signatures with Selective Linkability | 190-220 |
2019 | pkc | Let a Non-barking Watchdog Bite: Cliptographic Signatures with an Offline Watchdog | 221-251 |
2019 | pkc | Zero-Knowledge Elementary Databases with More Expressive Queries | 255-285 |
2019 | pkc | Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup | 286-313 |
2019 | pkc | Shorter Quadratic QA-NIZK Proofs | 314-343 |
2019 | pkc | Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts | 344-373 |
2019 | pkc | Publicly Verifiable Proofs from Blockchains | 374-401 |
2019 | pkc | Identity-Based Broadcast Encryption with Efficient Revocation | 405-435 |
2019 | pkc | Tightly Secure Hierarchical Identity-Based Encryption | 436-465 |
2019 | pkc | Leakage-Resilient Identity-Based Encryption in Bounded Retrieval Model with Nearly Optimal Leakage-Ratio | 466-495 |
2019 | pkc | Additively Homomorphic IBE from Higher Residuosity | 496-515 |
2019 | pkc | Upper and Lower Bounds for Continuous Non-Malleable Codes | 519-548 |
2019 | pkc | Improved Security Evaluation Techniques for Imperfect Randomness from Arbitrary Distributions | 549-580 |
2019 | pkc | On Tightly Secure Primitives in the Multi-instance Setting | 581-611 |
2019 | pkc | Collusion Resistant Broadcast and Trace from Positional Witness Encryption | 3-33 |
2019 | pkc | Break-glass Encryption | 34-62 |
2019 | pkc | Registration-Based Encryption from Standard Assumptions | 63-93 |
2019 | pkc | FE for Inner Products and Its Application to Decentralized ABE | 97-127 |
2019 | pkc | Decentralizing Inner-Product Functional Encryption | 128-157 |
2019 | pkc | Non-zero Inner Product Encryption Schemes from Various Assumptions: LWE, DDH and DCR | 158-188 |
2019 | pkc | Function Private Predicate Encryption for Low Min-Entropy Predicates | 189-219 |
2019 | pkc | Adaptively Single-Key Secure Constrained PRFs for $$\mathrm {NC}^1$$ | 223-253 |
2019 | pkc | Obfuscating Simple Functionalities from Knowledge Assumptions | 254-283 |
2019 | pkc | What About Bob? The Inadequacy of CPA Security for Proxy Reencryption | 287-316 |
2019 | pkc | Adaptively Secure Proxy Re-encryption | 317-346 |
2019 | pkc | Generic Constructions of Robustly Reusable Fuzzy Extractor | 349-378 |
2019 | pkc | Safety in Numbers: On the Need for Robust Diffie-Hellman Parameter Validation | 379-407 |
2019 | pkc | Hunting and Gathering – Verifiable Random Functions from Standard Assumptions with Short Proofs | 408-437 |
2019 | pkc | Lattice-Based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance | 441-471 |
2019 | pkc | Towards Non-Interactive Zero-Knowledge for NP from LWE | 472-503 |
2019 | pkc | More Efficient Algorithms for the NTRU Key Generation Using the Field Norm | 504-533 |
2019 | pkc | Efficiently Masking Binomial Sampling at Arbitrary Orders for Lattice-Based Crypto | 534-564 |
2019 | pkc | Decryption Failure Attacks on IND-CCA Secure Lattice-Based Schemes | 565-598 |
2019 | pkc | Reducing the Key Size of McEliece Cryptosystem from Automorphism-induced Goppa Codes via Permutations | 599-617 |
2019 | pkc | A Decade of Dual Pairing Vector Spaces | |
2019 | pkc | Key Encapsulation Mechanism with Explicit Rejection in the Quantum Random Oracle Model | 618-645 |
2019 | pkc | Factoring Products of Braids via Garside Normal Form | 646-678 |
2019 | tcc | Algebraically Structured LWE, Revisited | 1-23 |
2019 | tcc | Lattice Trapdoors and IBE from Middle-Product LWE | 24-54 |
2019 | tcc | Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation | 55-80 |
2019 | tcc | Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems | 81-110 |
2019 | tcc | A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement | 111-130 |
2019 | tcc | Synchronous Consensus with Optimal Asynchronous Fallback Guarantees | 131-150 |
2019 | tcc | Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank | 151-173 |
2019 | tcc | Optimal Bounded-Collusion Secure Functional Encryption | 174-198 |
2019 | tcc | From FE Combiners to Secure MPC and Back | 199-228 |
2019 | tcc | (Pseudo) Random Quantum States with Binary Phase | 229-250 |
2019 | tcc | General Linear Group Action on Tensors: A Candidate for Post-quantum Cryptography | 251-281 |
2019 | tcc | Composable and Finite Computational Security of Quantum Message Transmission | 282-311 |
2019 | tcc | On Fully Secure MPC with Solitary Output | 312-340 |
2019 | tcc | Secure Computation with Preprocessing via Function Secret Sharing | 341-371 |
2019 | tcc | Efficient Private PEZ Protocols for Symmetric Functions | 372-392 |
2019 | tcc | The Function-Inversion Problem: Barriers and Opportunities | 393-421 |
2019 | tcc | On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations | 422-450 |
2019 | tcc | Characterizing Collision and Second-Preimage Resistance in Linicrypt | 451-470 |
2019 | tcc | Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings | 471-501 |
2019 | tcc | Is Information-Theoretic Topology-Hiding Computation Possible? | 502-530 |
2019 | tcc | Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation | 531-560 |
2019 | tcc | On Perfectly Secure 2PC in the OT-Hybrid Model | 561-595 |
2019 | tcc | Succinct Arguments in the Quantum Random Oracle Model | 1-29 |
2019 | tcc | Delegating Quantum Computation in the Quantum Random Oracle Model | 30-60 |
2019 | tcc | Tighter Proofs of CCA Security in the Quantum Random Oracle Model | 61-90 |
2019 | tcc | Attribute Based Encryption for Deterministic Finite Automata from $$\mathsf{DLIN}$$ | 91-117 |
2019 | tcc | CPA-to-CCA Transformation for KDM Security | 118-148 |
2019 | tcc | New Approaches to Traitor Tracing with Embedded Identities | 149-179 |
2019 | tcc | A Unified and Composable Take on Ratcheting | 180-210 |
2019 | tcc | Continuously Non-malleable Secret Sharing for General Access Structures | 211-232 |
2019 | tcc | Interactive Non-malleable Codes | 233-263 |
2019 | tcc | Stronger Lower Bounds for Online ORAM | 264-284 |
2019 | tcc | Adaptively Secure Garbling Schemes for Parallel Computations | 285-310 |
2019 | tcc | Statistical Difference Beyond the Polarizing Regime | 311-332 |
2019 | tcc | Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness | 333-355 |
2019 | tcc | Fully Homomorphic NIZK and NIWI Proofs | 356-385 |
2019 | tcc | Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND | 386-406 |
2019 | tcc | Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles | 407-437 |
2019 | tcc | Compressible FHE with Applications to PIR | 438-464 |
2019 | tcc | Permuted Puzzles and Cryptographic Hardness | 465-493 |
2019 | tcc | Linear-Size Constant-Query IOPs for Delegating Computation | 494-521 |
2019 | tcc | On the (In)security of Kilian-Based SNARGs | 522-551 |
2019 | tcc | Incrementally Verifiable Computation via Incremental PCPs | 552-576 |
2019 | tcc | Indistinguishability Obfuscation without Multilinear Maps | |
2019 | tcc | A Complexity-Theoretic Perspective on Algorithmic Fairness | |
2019 | tcc | How bad is worst-case data if you know where it comes from? | |
2019 | tches | Methodology for Efficient CNN Architectures in Profiling Attacks | online |
2019 | tches | Recovering the CTR_DRBG state in 256 traces | online |
2019 | tches | Lightweight Authenticated Encryption Mode of Operation for Tweakable Block Ciphers | online |
2019 | tches | SITM: See-In-The-Middle Side-Channel Assisted Middle Round Differential Cryptanalysis on SPN Block Ciphers | online |
2019 | tches | Power Analysis on NTRU Prime | online |
2019 | tches | Share-slicing: Friend or Foe? | online |
2019 | tches | CAS-Lock: A Security-Corruptibility Trade-off Resilient Logic Locking Scheme | online |
2019 | tches | Improved Heuristics for Short Linear Programs | online |
2019 | tches | Cache vs. Key-Dependency: Side Channeling an Implementation of Pilsung | online |
2019 | tches | TEDT, a Leakage-Resist AEAD Mode for High Physical Security Applications | online |
2019 | tches | Bluethunder: A 2-level Directional Predictor Based Side-Channel Attack against SGX | online |
2019 | tches | A Comprehensive Study of Deep Learning for Side-Channel Analysis | online |
2019 | tches | AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT | online |
2019 | tches | Best Information is Most Successful | online |
2019 | tches | Secure Data Retrieval on the Cloud: Homomorphic Encryption meets Coresets | online |
2019 | tches | Non-Profiled Deep Learning-based Side-Channel attacks with Sensitivity Analysis | online |
2019 | tches | Deep Learning to Evaluate Secure RSA Implementations | online |
2019 | tches | Towards Globally Optimized Masking: From Low Randomness to Low Noise Rate | online |
2019 | tches | Shaping the Glitch: Optimizing Voltage Fault Injection Attacks | online |
2019 | tches | Analysis and Improvement of Differential Computation Attacks against Internally-Encoded White-Box Implementations | online |
2019 | tches | Glitch-Resistant Masking Revisited | online |
2019 | tches | Reducing a Masked Implementation’s Effective Security Order with Setup Manipulations | online |
2019 | tches | Multi-Tuple Leakage Detection and the Dependent Signal Issue | online |
2019 | tches | M&M: Masks and Macs against Physical Attacks | online |
2019 | tches | Return of the Hidden Number Problem. A Widespread and Novel Key Extraction Attack on ECDSA and DSA | online |
2019 | tches | Error Amplification in Code-based Cryptography | online |
2019 | tches | Implementing RLWE-based Schemes Using an RSA Co-Processor | online |
2019 | tches | 3-Share Threshold Implementation of AES S-box without Fresh Randomness | online |
2019 | tches | Secure Physical Enclosures from Covers with Tamper-Resistance | online |
2019 | tches | Practical Evaluation of Protected Residue Number System Scalar Multiplication | online |
2019 | tches | Improving CEMA using Correlation Optimization | online |
2019 | tches | Fully Automated Differential Fault Analysis on Software Implementations of Block Ciphers | online |
2019 | tches | The Curse of Class Imbalance and Conflicting Metrics with Machine Learning for Side-channel Evaluations | online |
2019 | tches | New Insights to Key Derivation for Tamper-Evident Physical Unclonable Functions | online |
2019 | tches | Fast, Furious and Insecure: Passive Keyless Entry and Start Systems in Modern Supercars | online |
2019 | tches | Covert Gates: Protecting Integrated Circuits with Undetectable Camouflaging | online |
2019 | tches | Consolidating Security Notions in Hardware Masking | online |
2019 | tches | SMT Attack: Next Generation Attack on Obfuscated Circuits with Capabilities and Performance Beyond the SAT Attacks | online |
2019 | tches | Make Some Noise. Unleashing the Power of Convolutional Neural Networks for Profiled Side-channel Analysis | online |
2019 | tches | NTTRU: Truly Fast NTRU Using NTT | online |
2019 | tches | Static Power SCA of Sub-100 nm CMOS ASICs and the Insecurity of Masking Schemes in Low-Noise Environments | online |
2019 | tches | Exploring the Effect of Device Aging on Static Power Analysis Attacks | online |
2019 | tches | Software Toolkit for HFE-based Multivariate Schemes | online |
2019 | tches | Leaky Noise: New Side-Channel Attack Vectors in Mixed-Signal IoT Devices | online |
2019 | tches | Fast constant-time gcd computation and modular inversion | online |
2019 | tches | Security on Plastics: Fake or Real? | online |
2019 | tches | Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols | online |
2019 | tches | Electromagnetic Information Extortion from Electronic Devices Using Interceptor and Its Countermeasure | online |
2019 | tches | New Circuit Minimization Techniques for Smaller and Faster AES SBoxes | online |
2019 | tches | On-Device Power Analysis Across Hardware Security Domains. | online |
2019 | tches | Fast and simple constant-time hashing to the BLS12-381 elliptic curve | online |
2019 | tches | Novel Side-Channel Attacks on Quasi-Cyclic Code-Based Cryptography | online |
2019 | tches | Cache-Timing Attacks on RSA Key Generation | online |
2019 | tches | The Interpose PUF: Secure PUF Design against State-of-the-art Machine Learning Attacks | online |
2019 | tosc | ZOCB and ZOTR: Tweakable Blockcipher Modes for Authenticated Encryption with Full Absorption | online |
2019 | tosc | Quantum Security Analysis of AES | online |
2019 | tosc | New Conditional Cube Attack on Keccak Keyed Modes | online |
2019 | tosc | The Exact Security of PMAC with Two Powering-Up Masks | online |
2019 | tosc | On Beyond-Birthday-Bound Security: Revisiting the Development of ISO/IEC 9797-1 MACs | online |
2019 | tosc | Classification of Balanced Quadratic Functions | online |
2019 | tosc | Reconstructing an S-box from its Difference Distribution Table | online |
2019 | tosc | Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks | online |
2019 | tosc | CRAFT: Lightweight Tweakable Block Cipher with Efficient Protection Against DFA Attacks | online |
2019 | tosc | libInterMAC: Beyond Confidentiality and Integrity in Practice | online |
2019 | tosc | Constructing Low-latency Involutory MDS Matrices with Lightweight Circuits | online |
2019 | tosc | Boomerang Connectivity Table Revisited. Application to SKINNY and AES | online |
2019 | tosc | Boomerang Switch in Multiple Rounds. Application to AES Variants and Deoxys | online |
2019 | tosc | A General Proof Framework for Recent AES Distinguishers | online |
2019 | tosc | Zero-Correlation Attacks on Tweakable Block Ciphers with Linear Tweakey Expansion | online |
2019 | tosc | Related-Tweak Statistical Saturation Cryptanalysis and Its Application on QARMA | online |
2019 | tosc | General Diffusion Analysis: How to Find Optimal Permutations for Generalized Type-II Feistel Schemes | online |
2019 | tosc | Partitions in the S-Box of Streebog and Kuznyechik | online |
2019 | tosc | PEIGEN – a Platform for Evaluation, Implementation, and Generation of S-boxes | online |
2019 | tosc | Preface to Volume 2019, Issue 1 | online |
2019 | tosc | A new SNOW stream cipher called SNOW-V | online |
2019 | tosc | DoveMAC: A TBC-based PRF with Smaller State, Full Security, and High Rate | online |
2019 | tosc | Revisit Division Property Based Cube Attacks: Key-Recovery or Distinguishing Attacks? | online |
2019 | tosc | Cryptanalysis of Plantlet | online |
2019 | tosc | New Related-Tweakey Boomerang and Rectangle Attacks on Deoxys-BC Including BDT Effect | online |
2019 | tosc | Substitution Attacks against Message Authentication | online |
2019 | tosc | New Semi-Free-Start Collision Attack Framework for Reduced RIPEMD-160 | online |
2019 | tosc | Security of Symmetric Primitives against Key-Correlated Attacks | online |
2019 | tosc | Exhaustive Search for Various Types of MDS Matrices | online |