Pages that link to "Item:Q2829208"
From MaRDI portal
The following pages link to Advances in Cryptology – CRYPTO 2016 (Q2829208):
Displaying 50 items.
- Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem (Q2829212) (← links)
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS (Q2829213) (← links)
- Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks (Q2829214) (← links)
- Memory-Efficient Algorithms for Finding Needles in Haystacks (Q2829215) (← links)
- Breaking Symmetric Cryptosystems Using Quantum Period Finding (Q2829216) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- ParTI – Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks (Q2829219) (← links)
- Network-Hiding Communication and Applications to Multi-party Protocols (Q2829220) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- Cryptanalysis of GGH15 Multilinear Maps (Q2829232) (← links)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (Q2829233) (← links)
- Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE (Q2829234) (← links)
- Circular Security Separations for Arbitrary Length Cycles from LWE (Q2829235) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications (Q2829942) (← links)
- Semantic Security and Indistinguishability in the Quantum World (Q2829943) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security (Q2835581) (← links)
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers (Q2835582) (← links)
- XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees (Q2835583) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
