Ching-Hua Yu

  • Citations Per Year
Learn More
We present a new framework to design secure two-party computation protocols for exponentiation over integers and over ZQ where Q is a publicly-known prime. Using our framework, we realize efficient protocols in the semi-honest setting. Assuming the base is non-zero, and the exponent is at most Q/2 for the ZQ case, our protocols consist of at most 5 rounds(More)
In the rich literature of secure multi-party computation (MPC), several important results rely on<lb>“protocol transformations,” whereby protocols from one model of MPC are transformed to protocols<lb>from another model. Motivated by the goal of simplifying and unifying results in the area of MPC, we<lb>formalize a general notion of black-box protocol(More)
In this paper, we deal with the linguistic analysis approach adopted in the Formosan Language Corpora, one of the three main information databases included in the Formosan Language Archive, and the language processing programs that have been built upon it. We first discuss problems related to the transcription of different language corpora. We then deal(More)
We extend the simulation-based definition of Virtual Grey Box (VGB) security – originally proposed for obfuscation (Bitansky and Canetti, 2010) – to a broad class of cryptographic primitives. These include functional encryption, graded encoding schemes, bi-linear maps (with über assumptions), as well as unexplored ones like homomorphic functional(More)
In general, the outcome of games can deviate from the predicted equilibria, and the players’ behavior can disobey their presumed utility function. • the utility function and make it accurate? Sometimes hard to predict or to accurately model. • Faulty players can just become spontaneous or unwilling to follow a reasonable utility under a model. Hence it is(More)
In 1994 [18], Feige, Killian, and Naor suggested a toy protocol of secure comparison, which takes secret input [x]7 and [y]7 between 0 and 2, using the modulo 7 arithmetic circuit. Because 0, 1, and 2 are quadratic residues while 5 and 6 are non-residues modulo 7, the protocol is done by securely evaluating the Legendre symbol of [x− y]7, which can be(More)
Most social networks exhibit community structures, in which nodes are tightly connected to each other within a community but only loosely connected to nodes in other communities. Researches on community mining have received a lot of attention; however, most of them are based on a centralized system model and thus not applicable to the distributed model of(More)
When secure arithmetic is required, computation based on secure multiplication (MULT) is much more efficient than computation based on secure boolean circuits. However, a typical application can also require other building blocks, such as comparison, exponentiation and the modulo (MOD) operation. Secure solutions for these functions proposed in the(More)
  • 1