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.

Improved OT Extension for Transferring Short Secrets: Label: en
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation: Label: en
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose: Label: en
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries: Label: en
How to Run Turing Machines on Encrypted Data: Label: en
On the Achievability of Simulation-Based Security for Functional Encryption: Label: en
Functional Encryption: New Perspectives and Lower Bounds: Label: en
Attribute-Based Encryption for Circuits from Multilinear Maps: Label: en
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption: Label: en
Fully, (Almost) Tightly Secure IBE and Dual System Groups: Label: en
Obfuscating Conjunctions: Label: en
Instantiating Random Oracles via UCEs: Label: en
Everlasting Multi-party Computation: Label: en
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World: Label: en
Quantum One-Time Programs: Label: en
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling: Label: en
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs: Label: en
Linearly Homomorphic Structure-Preserving Signatures and Their Applications: Label: en
Secret Sharing, Rank Inequalities and Information Inequalities: Label: en
Optimal Coding for Streaming Authentication and Interactive Communication: Label: en
Non-malleable Codes from Two-Source Extractors: Label: en
What Information Is Leaked under Concurrent Composition?: Label: en
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation: Label: en
Efficient Multiparty Protocols via Log-Depth Threshold Formulae: Label: en
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys: Label: en
Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields: Label: en
An Algebraic Framework for Diffie-Hellman Assumptions: Label: en
On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Label: en
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge: Label: en
Time-Optimal Interactive Proofs for Circuit Evaluation: Label: en
Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions: Label: en
Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers: Label: en
On the Indifferentiability of Key-Alternating Ciphers: Label: en
Programmable Hash Functions in the Multilinear Setting: Label: en
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures: Label: en
Practical Multilinear Maps over the Integers: Label: en
New Techniques for SPHFs and Efficient One-Round PAKE Protocols: Label: en
On the Security of the TLS Protocol: A Systematic Analysis: Label: en
Key Homomorphic PRFs and Their Applications: Label: en
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries: Label: en
Message-Locked Encryption for Lock-Dependent Messages: Label: en
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries: Label: en
Leakage-Resilient Symmetric Cryptography under Empirically Verifiable Assumptions: Label: en
Secure Computation against Adaptive Auxiliary Information: Label: en
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols: Label: en
Limits on the Power of Cryptographic Cheap Talk: Label: en
On Fair Exchange, Fair Coins and Fair Sampling: Label: en
Construction of Differential Characteristics in ARX Designs Application to Skein: Label: en
Sieve-in-the-Middle: Improved MITM Attacks: Label: en
Bounds in Shallows and in Miseries: Label: en