The following pages link to Daniel Kraschewski (Q2304928):
Displaying 10 items.
- Reusable non-interactive secure computation (Q2304929) (← links)
- On Definitions of Selective Opening Security (Q2900240) (← links)
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token (Q3000538) (← links)
- Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (Q3000549) (← links)
- Efficient Reductions for Non-signaling Cryptographic Primitives (Q3002108) (← links)
- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions (Q3467154) (← links)
- Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation (Q5200458) (← links)
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens (Q5261634) (← links)
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (Q5418721) (← links)
- All Complete Functionalities are Reversible (Q5739203) (← links)
