Crypto 2018
76 talks · 2018 · indexed by Breach Arc Archive. Links open each talk on YouTube.
Browse with filters →- A Key recovery Attack on 855 round Trivium 2018
- A New Public Key Cryptosystem via Mersenne Numbers 2018
- A Simple Obfuscation Scheme for Pattern Matching with Wildcards 2018
- Amortized Complexity of Information Theoretically Secure MPC Revisted 2018
- An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing 2018
- Berstein Bound on WCS is Tight Repairing Luykx Preneel Optimal Forgeries 2018
- CAPA The Spirit of Beaver Against Physical Attacks 2018
- Combiners for Backdoored Random Oracles 2018
- Continuously Non Malleable Codes in the Split State Model from Minimal Assumptions 2018
- Contrained PRFs for NC1 in Traditional Groups 2018
- Correcting Subverted Random Oracles 2018
- Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem 2018
- Cryptanalysis via Algebraic Spans 2018
- Crypto: A Key Ingredient to Building Respectful Products 2018
- Dissection BKW 2018
- Encrypt or Decrypt To Make a Single Key Beyond Birthday Secure Nonce Based MAC 2018
- Fast Correlation Attack Revisted 2018
- Fast Distributed RSA Key Generation for Semi Honest and Malicious Adversaries 2018
- Fast Homomorphic Evaluation of Deep Discretized Neural Networks 2018
- Fast Large Scale Honest Majority MPC for Malicious Adversaries 2018
- Fast Message Franking From Invisible Salamanders to Encryptment 2018
- Faster Homomorphic Linear Transformations in HElib 2018
- From Idea to Impact, the Crypto Story: What's Next? 2018
- From Laconic Zero Knowledge to Public Key Cryptography 2018
- Generic Attacks Against Beyond Birthday Bound MACs 2018
- GGH15 Beyond Permutation Branching Programs Proofs, Attacks and Candidates 2018
- Hardness of Non Interactive Differential Privacy from One Way Functions & Risky Traitor Tracing and 2018
- Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly 2018
- IND CCA secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited 2018
- Indifferentiable Authenticated Encryption 2018
- Lattice Based Zero Knowledge Arguments for Integer Relations 2018
- Limits of Practical Sublinear Secure Computation 2018
- Limits on the Power of Garbling Techniques for Public Key Encryption 2018
- Lower Bounds on Lattice Enumeration with Extreme Pruning 2018
- Multi Input Functional Encryption for Inner Products Function Hiding Realizations and Constructions 2018
- Multi Theorem Preprocessing NIZKs from Lattices 2018
- Must the Communication Graph of MPC Protocols be an Expander 2018
- Non Interactive Zero Knowledge Proofs for Composite Statements 2018
- Non Malleable Codes for Partial Functions with Manipulation Detection 2018
- Non Malleable Secret Sharing for General Access Structures 2018
- Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models 2018
- On Distributional Collision Resistant Hashing 2018
- On the Complexity of Compressing Obfuscation 2018
- On the Exact Round Complexity of Secure Three Party Computation 2018
- On the Local Leakage Resilience of Linear Secret Sharing Schemes 2018
- On the Round Complexity of OT Extension 2018
- On Tightly Secure Non Interactive Key Exchange 2018
- Optimal Channel Security Against Fine Graine State Compromise The Safety of Messaging 2018
- Optimizing Authenticated Garbling for Faster Secure Two Party Computation 2018
- Out of Band Authentication in Group Messaging Computational, Statistical, Optimal 2018
- Practical and Tightly Secure Digital Signatures and Authenticated Key Exchange 2018
- Private Circuits A Modular Approach 2018
- Promise Zero Knowledge and its Applications to Round Optimal MPC 2018
- Proofs of Work from Worst Case Assumptions 2018
- Provable Security of Tweakable Block Ciphers Based on Substitution Permutation Networks 2018
- Pseudorandom Quantum States 2018
- Quantum FHE Almost As Secure As Classical 2018
- Rasta A Cipher with Low ANDdepth and Few ANDs per Bit 2018
- Round Optimal Secure Multi Party Computation 2018
- Round Optimal Secure Multiparty Computation with Honest Majority 2018
- Searchable Encryption with Optimal Locality Achieving Sublogarithmic Read Efficiency 2018
- Simplifying Game Based Definitions 2018
- SPDZ2k Efficient MPC mod 2^k for Dishonest Majority 2018
- Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits 2018
- The Algebraic Group Model and its Applications 2018
- The Curse of Small Domains New Attacks on Format Preserving Encryption 2018
- Threshold Cryptosystems From Threshold Fully Homomorphic Encryption 2018
- Tight Tradeoffs in Searchable Symmetric Encryption 2018
- TinyKeys A New Approach to Efficient Multi Party Computation 2018
- Towards Bidirectional Ratcheted Key Exchange 2018
- Trapdoor Functions from the Computational Diffie Hellman Assumption 2018
- Two Round Multiparty Secure Computation Minimizing Public Key Operations 2018
- Updatable and Universal Comon Reference Strings with Applications to zk SNARKs 2018
- Verifiable Delay Functions 2018
- Yes, There is an Oblivious RAM Lower Bound! 2018
- Yet Another Compiler for Active Security or Efficient MPC Over Arbitrary Rings 2018