Entity usage

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.

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

Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2: Label: en
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments: Label: en
Notions of Black-Box Reductions, Revisited: Label: en
Random Projections, Graph Sparsification, and Differential Privacy: Label: en
Function-Private Subspace-Membership Encryption and Its Applications: Label: en
Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency: Label: en
SPHF-Friendly Non-interactive Commitments: Label: en
Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization: Label: en
Computational Fuzzy Extractors: Label: en
Reset Indifferentiability and Its Consequences: Label: en
Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited: Label: en
New Insight into the Isomorphism of Polynomial Problem IP1S and Its Use in Cryptography: Label: en
Discrete Gaussian Leftover Hash Lemma over Infinite Domains: Label: en
Four-Dimensional GLV via the Weil Restriction: Label: en
Families of Fast Elliptic Curves from ℚ-curves: Label: en
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes: Label: en
Constant-Round Concurrent Zero Knowledge in the Bounded Player Model: Label: en
Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces: Label: en
SCARE of Secret Ciphers with SPN Structures: Label: en
Behind the Scene of Side Channel Attacks: Label: en
Does My Device Leak Information? An a priori Statistical Power Analysis of Leakage Detection Tests: Label: en
Generic Key Recovery Attack on Feistel Scheme: Label: en
How to Construct an Ideal Cipher from a Small Set of Public Permutations: Label: en
Parallelizable and Authenticated Online Ciphers: Label: en
A Modular Framework for Building Variable-Input-Length Tweakable Ciphers: Label: en
Leaked-State-Forgery Attack against the Authenticated Encryption Algorithm ALE: Label: en
Key Difference Invariant Bias in Block Ciphers: Label: en
On Diamond Structures and Trojan Message Attacks: Label: en
Limited-Birthday Distinguishers for Hash Functions: Label: en
Improved Cryptanalysis of Reduced RIPEMD-160: Label: en
A Heuristic for Finding Compatible Differential Paths with Application to HAS-160: Label: en
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique: Label: en
Hiding the Input-Size in Secure Two-Party Computation: Label: en
On Continual Leakage of Discrete Log Representations: Label: en
Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter: Label: en
Naturally Rehearsing Passwords: Label: en
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild: Label: en
Non-uniform Cracks in the Concrete: The Power of Free Precomputation: Label: en
Fully Homomorphic Message Authenticators: Label: en
Constrained Pseudorandom Functions and Their Applications: Label: en
Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters: Label: en
Building Lossy Trapdoor Functions from Lossy Encryption: Label: en
Between a Rock and a Hard Place: Interpolating between MPC and FHE: Label: en
Fair and Efficient Secure Multiparty Computation with Reputation Systems: Label: en
Efficient General-Adversary Multi-Party Computation: Label: en
Tamper Resilient Circuits: The Adversary at the Gates: Label: en
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier: Label: en
Functional Encryption from (Small) Hardware Tokens: Label: en
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions: Label: en
On the Security of One-Witness Blind Signature Schemes: Label: en