Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions: Label: en
  2. Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience: Label: en
  3. Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions: Label: en
  4. A Tale of Two Shares: Why Two-Share Threshold Implementation Seems Worthwhile—and Why It Is Not: Label: en
  5. A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors: Label: en
  6. Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials: Label: en
  7. The Kernel Matrix Diffie-Hellman Assumption: Label: en
  8. Optimization of $$\mathsf {LPN}$$ Solving Algorithms: Label: en
  9. Reverse Cycle Walking and Its Applications: Label: en
  10. Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers: Label: en
  11. A New Algorithm for the Unbalanced Meet-in-the-Middle Problem: Label: en
  12. Unknown-Input Attacks in the Parallel Setting: Improving the Security of the CHES 2012 Leakage-Resilient PRF: Label: en
  13. Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations: Label: en
  14. Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations: Label: en
  15. Side-Channel Analysis Protection and Low-Latency in Action: Label: en
  16. Design Strategies for ARX with Provable Bounds: Sparx and LAX: Label: en
  17. How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers: Label: en
  18. Salvaging Weak Security Bounds for Blockcipher-Based Constructions: Label: en
  19. Authenticated Encryption with Variable Stretch: Label: en
  20. Statistical Fault Attacks on Nonce-Based Authenticated Encryption Schemes: Label: en
  21. Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm: Label: en
  22. Trick or Tweak: On the (In)security of OTR’s Tweaks: Label: en
  23. More Powerful and Reliable Second-Level Statistical Randomness Tests for NIST SP 800-22: Label: en
  24. When Are Fuzzy Extractors Possible?: Label: en
  25. Linear Structures: Applications to Cryptanalysis of Round-Reduced Keccak: Label: en
  26. Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks: Label: en
  27. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity: Label: en
  28. Efficient and Provable White-Box Primitives: Label: en
  29. Towards Practical Whitebox Cryptography: Optimizing Efficiency and Space Hardness: Label: en
  30. Simpira v2: A Family of Efficient Permutations Using the AES Round Function: Label: en
  31. On the Security of Supersingular Isogeny Cryptosystems: Label: en
  32. A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm: Label: en
  33. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds: Label: en
  34. Nonlinear Invariant Attack: Label: en
  35. Multi-input Functional Encryption with Unbounded-Message Security: Label: en
  36. Multi-key Homomorphic Authenticators: Label: en
  37. How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones: Label: en
  38. From Identification to Signatures, Tightly: A Framework and Generic Transforms: Label: en
  39. Towards Tightly Secure Lattice Short Signature and Id-Based Encryption: Label: en
  40. Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions: Label: en
  41. Structure-Preserving Smooth Projective Hashing: Label: en
  42. Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions: Label: en
  43. Selective-Opening Security in the Presence of Randomness Failures: Label: en
  44. Selective Opening Security from Simulatable Data Encapsulation: Label: en
  45. Adaptive Oblivious Transfer and Generalization: Label: en
  46. Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings: Label: en
  47. Collapse-Binding Quantum Commitments Without Random Oracles: Label: en
  48. From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures: Label: en
  49. Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption: Label: en
  50. Zero-Knowledge Accumulators and Set Algebra: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)