The following pages link to Thomas Holenstein (Q271580):
Displaying 27 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- A Protocol for Generating Random Elements with Their Probabilities (Q2920458) (← links)
- A New View on Worst-Case to Average-Case Reductions for NP Problems (Q2920459) (← links)
- (Q2955011) (← links)
- Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power (Q2969652) (← links)
- General Hardness Amplification of Predicates and Puzzles (Q3000529) (← links)
- (Q3002807) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- (Q3549639) (← links)
- Universal One-Way Hash Functions via Inaccessible Entropy (Q3563858) (← links)
- (Q3579482) (← links)
- Key agreement from weak bit agreement (Q3581457) (← links)
- On the (Im)Possibility of Key Dependent Encryption (Q3611767) (← links)
- (Q4434868) (← links)
- Lower Bounds on Same-Set Inner Product in Correlated Spaces (Q4636467) (← links)
- Product Space Models of Correlation: Between Noise Stability and Additive Combinatorics (Q4645045) (← links)
- A Cookbook for Black-Box Separations and a Recipe for UOWHFs (Q4910304) (← links)
- (Q5140842) (← links)
- On the Randomness of Independent Experiments (Q5280954) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307267) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311559) (← links)
- (Q5365060) (← links)
- The equivalence of the random oracle model and the ideal cipher model, revisited (Q5419078) (← links)
- One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption (Q5451044) (← links)
- Theory of Cryptography (Q5898368) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5915679) (← links)
- The communication complexity of private simultaneous messages, revisited (Q5918864) (← links)
