The following pages link to Huafei Zhu (Q3001857):
Displaying 22 items.
- Public-Key Encryptions Tolerating Adaptive and Composable Adversaries (Q3001858) (← links)
- Non-black-Box Computation of Linear Regression Protocols with Malicious Adversaries (Q3001902) (← links)
- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity (Q3019915) (← links)
- Adaptive and Composable Non-committing Encryptions (Q3163101) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions (Q3637148) (← links)
- Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems (Q3652336) (← links)
- Information Security and Privacy (Q5315256) (← links)
- Information and Communications Security (Q5394004) (← links)
- Information and Communications Security (Q5394028) (← links)
- Information and Communications Security (Q5464828) (← links)
- Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols (Q5502762) (← links)
- Round Optimal Universally Composable Oblivious Transfer Protocols (Q5505480) (← links)
- (Q5701002) (← links)
- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures (Q5756529) (← links)
- Oblivious Scalar-Product Protocols (Q5757718) (← links)
- More on Stand-Alone and Setup-Free Verifiably Committed Signatures (Q5757729) (← links)
- Augmented Oblivious Polynomial Evaluation Protocol and Its Applications (Q5862667) (← links)
- Information Security and Cryptology (Q5897810) (← links)
- Topics in Cryptology – CT-RSA 2006 (Q5898562) (← links)
- Public Key Cryptography – PKC 2004 (Q5901797) (← links)
