Pages that link to "Item:Q2953770"
From MaRDI portal
The following pages link to Advances in Cryptology – ASIACRYPT 2016 (Q2953770):
Displaying 50 items.
- Nonlinear Invariant Attack (Q2953771) (← links)
- Cliptography: Clipping the Power of Kleptographic Attacks (Q2953772) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures (Q2953775) (← links)
- Collapse-Binding Quantum Commitments Without Random Oracles (Q2953776) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
- Selective Opening Security from Simulatable Data Encapsulation (Q2953779) (← links)
- Selective-Opening Security in the Presence of Randomness Failures (Q2953780) (← links)
- Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions (Q2953781) (← links)
- Structure-Preserving Smooth Projective Hashing (Q2953782) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones (Q2953786) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Verifiable Functional Encryption (Q2953789) (← links)
- Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings (Q2953790) (← links)
- Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting (Q2953791) (← links)
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions (Q2953792) (← links)
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction (Q2953795) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Efficient Public-Key Distance Bounding Protocol (Q2953799) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Size-Hiding Computation for Multiple Parties (Q2953801) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Reactive Garbling: Foundation, Instantiation, Application (Q2953804) (← links)
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- On the Security of Supersingular Isogeny Cryptosystems (Q2958115) (← links)
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function (Q2958116) (← links)
- Towards Practical Whitebox Cryptography: Optimizing Efficiency and Space Hardness (Q2958117) (← links)
- Efficient and Provable White-Box Primitives (Q2958118) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak (Q2958122) (← links)
- When Are Fuzzy Extractors Possible? (Q2958123) (← links)
- More Powerful and Reliable Second-Level Statistical Randomness Tests for NIST SP 800-22 (Q2958126) (← links)
- Trick or Tweak: On the (In)security of OTR’s Tweaks (Q2958127) (← links)
- Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm (Q2958128) (← links)
- Statistical Fault Attacks on Nonce-Based Authenticated Encryption Schemes (Q2958130) (← links)
- Authenticated Encryption with Variable Stretch (Q2958131) (← links)
- Salvaging Weak Security Bounds for Blockcipher-Based Constructions (Q2958132) (← links)
