The following pages link to Hong-Sheng Zhou (Q1710616):
Displaying 33 items.
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Correcting subverted random oracles (Q1784091) (← links)
- Let a non-barking watchdog bite: cliptographic signatures with an offline watchdog (Q2289210) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Statement voting (Q2656921) (← links)
- Leakage-Resilient Public-Key Encryption from Obfuscation (Q2798795) (← links)
- Cryptography for Parallel RAM from Indistinguishability Obfuscation (Q2800564) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← links)
- Functional Encryption from (Small) Hardware Tokens (Q2867149) (← links)
- On the Security of the “Free-XOR” Technique (Q2891475) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Distributing the setup in universally composable multi-party computation (Q2943608) (← links)
- Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware (Q2948381) (← links)
- Cliptography: Clipping the Power of Kleptographic Attacks (Q2953772) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer (Q3183582) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Concurrent Blind Signatures Without Random Oracles (Q3541878) (← links)
- Zero-Knowledge Proofs with Witness Elimination (Q3617517) (← links)
- Feasibility and Completeness of Cryptographic Tasks in the Quantum World (Q4910283) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Locally Decodable and Updatable Non-malleable Codes and Their Applications (Q5261639) (← links)
- Multi-Client Verifiable Computation with Stronger Security Guarantees (Q5261673) (← links)
- Secure Function Collection with Sublinear Storage (Q5321684) (← links)
- Multi-input Functional Encryption (Q5418717) (← links)
- Trading Static for Adaptive Security in Universally Composable Zero-Knowledge (Q5428819) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger (Q5739220) (← links)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens (Q5746357) (← links)
- (Q5874389) (← links)
