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

Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption: Label: en
On the Complexity of UC Commitments: Label: en
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation: Label: en
Distributed Point Functions and Their Applications: Label: en
Déjà Q: Using Dual Systems to Revisit q-Type Assumptions: Label: en
Salvaging Indifferentiability in a Multi-stage Setting: Label: en
Multi-input Functional Encryption: Label: en
Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More: Label: en
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits: Label: en
Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures: Label: en
Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig: Label: en
Efficient Round Optimal Blind Signatures: Label: en
How to Certify the Leakage of a Chip?: Label: en
Higher Order Masking of Look-Up Tables: Label: en
Unifying Leakage Models: From Probing Attacks to Noisy Leakage.: Label: en
Garbled RAM Revisited: Label: en
Non-Interactive Secure Computation Based on Cut-and-Choose: Label: en
A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure Computing: Label: en
The Locality of Searchable Symmetric Encryption: Label: en
Tight Security Bounds for Key-Alternating Ciphers: Label: en
Sometimes-Recurse Shuffle: Label: en
Honey Encryption: Security Beyond the Brute-Force Bound: Label: en
Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions: Label: en
Reconsidering Generic Composition: Label: en
GGHLite: More Efficient Multilinear Maps from Ideal Lattices: Label: en
Protecting Obfuscation against Algebraic Attacks: Label: en
Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation: Label: en
Faster Compact Diffie–Hellman: Endomorphisms on the x-line: Label: en
Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities: Label: en
Generic Universal Forgery Attack on Iterative Hash-Based MACs: Label: en
Revocable Quantum Timed-Release Encryption: Label: en
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits: Label: en
Key Derivation without Entropy Waste: Label: en
Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack: Label: en
Why Proving HIBE Systems Secure Is Difficult: Label: en
Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus: Label: en
Polynomial Time Attack on Wild McEliece over Quadratic Extensions: Label: en
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic: Label: en