We present new constructions of round-efficient, or even round-optimal, MultiParty Computation (MPC) protocols from Oblivious Transfer (OT) protocols. Our constructions establish a tight connection between MPC and OT: In the setting of semi-honest security, for any k ≥ 2, k-round semi-honest OT is necessary and complete for k-round semi-honest MPC. In the round-optimal case of k = 2, we obtain ...

the karyotype of zagros tooth-carp, aphanius vladykovi (coad) has been investigated byexamining metaphase chromosomes spreads obtained from gill epithelial and kidney cells. the diploidchromosome number of this species was 2n=48. the karyotype consisted of 8 submetacentric and 40subtelocentric chromosomes (8sm+40 st). the arm number (nf) was 28. sex chromosomes werecytologically indistinguishab...

A Probabilistically Checkable Proof (PCP) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x ∈ L” by querying only few bits of the proof. A zero-knowledge PCP (ZKPCP) is a PCP with the additional guarantee that the view of any verifier querying a bounded number of proof bits can be efficiently simulated given the ...

We give a generic methodology to unlinkably anonymize cryptographic schemes in bilinear groups using the Boneh-Goh-Nissim cryptosystem and nizk proofs in the line of Groth, Ostrovsky and Sahai. We illustrate our techniques by presenting the first instantiation of anonymous proxy signatures (in the standard model), a recent primitive unifying the functionalities and strong security notions of gr...

Duality in the entanglement of identical particles manifests that only one variable can be revealed at a time. We demonstrate this using polarization and orbital angular momentum (OAM) variables indistinguishable photons generated from parametric down-conversion. show by sorting even odd OAM basis, while them two orthogonal modes reveals entanglement. Indistinguishable entangled could find appl...