35 Result(s)
within
Hua** Zhu
Computer Science
Cryptology
-
Chapter and Conference Paper
Sustainable Pseudo-random Number Generator
Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators...
-
Chapter and Conference Paper
Optimal Trust Mining and Computing on Keyed MapReduce
This paper studies trust mining in the framework of keyed MapReduce and trust computing in the context of the Bayesian inferences and makes the following two-fold contributions:
-
Chapter and Conference Paper
Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
This paper studies error-free, multi-bit non-committing encryptions in the universally composable (UC) framework with constant round complexity. Previous efficient protocols such as the Beaver’s protocol and t...
-
Chapter and Conference Paper
Non-black-Box Computation of Linear Regression Protocols with Malicious Adversaries
Linear regression is a basic statistical method to correlate two or more attributes in data mining, machine learning, decision tree and Bayes classification. This paper studies non-black-box two-party computat...
-
Chapter and Conference Paper
Public-Key Encryptions Tolerating Adaptive and Composable Adversaries
It is a well-known result in the asynchronous model that no standard public-key encryption schemes tolerates adaptive adversaries in the universally composable framework. This paper provides a compiler techniq...
-
Chapter and Conference Paper
Adaptive and Composable Non-committing Encryptions
In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the...
-
Chapter and Conference Paper
Private Searching on MapReduce
In this paper, a private searching protocol on MapReduce is introduced and formalized within the Map**-Filtering-Reducing framework. The idea behind of our construction is that a map function Map is activate...
-
Chapter and Conference Paper
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems
Designing non-committing encryptions tolerating adaptive adversaries, who are able to corrupt parties on the fly in the course of computation has been a challenge task. In this paper, we make progress in this ...
-
Chapter and Conference Paper
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
In this paper, a new implementation of universally composable, 1-out-of-2 oblivious transfer in the presence of static adversaries is presented and analyzed. Our scheme is constructed from the state-of-the-art...
-
Chapter and Conference Paper
Adaptive and Composable Oblivious Transfer Protocols (Short Paper)
An adaptive k-out-of-n oblivious transfer protocol (OT \(_{k \times 1} ^n\) ) allows a receiver to obtain ...
-
Chapter and Conference Paper
New Constructions for Reusable, Non-erasure and Universally Composable Commitments
This paper proposes a novel construction of reusable and non-erasure commitment schemes in the common reference string model. We show that our implementation is secure in the universally composable paradigm as...
-
Chapter and Conference Paper
Round Optimal Universally Composable Oblivious Transfer Protocols
In this paper, a round optimal oblivious transfer protocol is proposed and analyzed. Our protocol is built upon the top of an oblivious double-trapdoor encryption scheme (the double-trapdoor information consis...
-
Chapter and Conference Paper
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
This paper studies constructions of \(k \choose 1\) - oblivious transfer protocols in a black-box way. The security of
-
Chapter and Conference Paper
Fully-Simulatable Oblivious Set Transfer
In this paper, a new notion which we call oblivious set transfer is introduced and formalized. An oblivious set transfer in essence, is an extension of the notions of oblivious bit transfer and oblivious strin...
-
Chapter and Conference Paper
Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
Squared Euclidean Distance metric that uses the same equation as the Euclidean distance metric, but does not take the square root (thus clustering with the Squared Euclidean Distance metric is faster than clus...
-
Chapter and Conference Paper
Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signatures in the multi-party setting. We the...
-
Chapter and Conference Paper
More on Shared-Scalar-Product Protocols
Secure scalar product protocols provide fundamental security components for distributed data mining with privacy concerns. This paper makes two contributions in the shared-scalar-product protocols. In the firs...
-
Chapter and Conference Paper
Stand-Alone and Setup-Free Verifiably Committed Signatures
In this paper, a novel construction of stand-alone and setup-free verifiably committed signatures from RSA – an open problem advertised by Dodis and Reyzin in their speech [16] is presented. The methodology us...
-
Chapter and Conference Paper
Computing of Trust in Ad-Hoc Networks
Although, the notion of trust has been considered as a primitive for establishing relationships among nodes in ad-hoc networks, syntax and metrics of trust are not well defined. This paper studies computing of...
-
Chapter and Conference Paper
Finding Compact Reliable Broadcast in Unknown Fixed-Identity Networks (Short Paper)
At PODC’05, Subramanian, Katz, Roth, Shenker and Stoica (SKRSS) introduced and formulated a new theoretical problem called reliable broadcast problems in unknown fixed-identity networks [3] and further propose...
