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 42 results in range #1 to #42.

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

  1. Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions: Label: en
  2. On Concurrently Secure Computation in the Multiple Ideal Query Model: Label: en
  3. Resource-Restricted Indifferentiability: Label: en
  4. Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists: Label: en
  5. Quadratic Span Programs and Succinct NIZKs without PCPs: Label: en
  6. One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games: Label: en
  7. Quantum-Secure Message Authentication Codes: Label: en
  8. Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction: Label: en
  9. How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation: Label: en
  10. MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions: Label: en
  11. Circular Chosen-Ciphertext Security with Compact Ciphertexts: Label: en
  12. Amplification of Chosen-Ciphertext Security: Label: en
  13. Locally Computable UOWHF with Linear Shrinkage: Label: en
  14. Practical Signatures from Standard Assumptions: Label: en
  15. Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures: Label: en
  16. Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions: Label: en
  17. Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption: Label: en
  18. New Links between Differential and Linear Cryptanalysis: Label: en
  19. Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting: Label: en
  20. Streaming Authenticated Data Structures: Label: en
  21. Practical Homomorphic MACs for Arithmetic Circuits: Label: en
  22. Batch Fully Homomorphic Encryption over the Integers: Label: en
  23. Keccak: Label: en
  24. Message-Locked Encryption and Secure Deduplication: Label: en
  25. Dynamic Proofs of Retrievability via Oblivious RAM: Label: en
  26. Improving Local Collisions: New Attacks on Reduced SHA-256: Label: en
  27. New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis: Label: en
  28. Cryptanalysis of Full RIPEMD-128: Label: en
  29. Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” Problem: Label: en
  30. Fast Cryptography in Genus 2: Label: en
  31. Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields: Label: en
  32. Leakage-Resilient Cryptography from Minimal Assumptions: Label: en
  33. Masking against Side-Channel Attacks: A Formal Security Proof: Label: en
  34. Security Evaluations beyond Computing Power: Label: en
  35. How to Watermark Cryptographic Functions: Label: en
  36. Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions: Label: en
  37. Efficient Cryptosystems from 2 k -th Power Residue Symbols: Label: en
  38. Regularity of Lossy RSA on Subdomains and Its Applications: Label: en
  39. A Toolkit for Ring-LWE Cryptography: Label: en
  40. Lossy Codes and a New Variant of the Learning-With-Errors Problem: Label: en
  41. Candidate Multilinear Maps from Ideal Lattices: Label: en
  42. How to Garble RAM Programs?: Label: en

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