Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...

It turned out to be pretty easy for Yaniv Erlich to identify people who had donated their genomic data to science, even despite researchers’ attempts to make that data anonymous. Erlich, a former computer hacker hired by businesses to test the security of computer systems, only needed his tailor-made computer program and an Internet connection to access publicly available databases. Erlich, tho...

Sedarat, Franklin, Eric Lin, Edwin D. W. Moore, and Glen F. Tibbits. Deconvolution of confocal images of dihydropyridine and ryanodine receptors in developing cardiomyocytes. J Appl Physiol 97: 1098 –1103, 2004. First published April 2, 2004; 10.1152/ japplphysiol.00089.2004.—Colocalization of dihydropyridine (DHPR) and ryanodine (RyR) receptors, a key determinant of Ca induced Ca release, was ...

—Chameleon hash functions are trapdoor one-way functions with many applications such as chameleon signatures and on-line/off-line signatures. Previous research focused on the concrete constructions based on different assumptions, as well as schemes without the key-exposure problem. In this paper, we consider the structure-preserving schemes where messages, hash value and public keys all consis...

Increasingly, confidential medical records are being stored in data centers hosted by hospitals or large companies. As sophisticated algorithms for predictive analysis on medical data continue to be developed, it is likely that, in the future, more and more computation will be done on private patient data. While encryption provides a tool for assuring the privacy of medical information, it limi...

In this thesis we study two remotely related cryptographic primitives: homomorphic encryption and enhanced trapdoor permutations. Our main result regarding homomorphic encryption shows that any private-key encryption scheme that is weakly homomorphic with respect to addition modulo 2, can be transformed into a public-key encryption scheme. The homomorphic feature referred to is a minimalistic o...

At PKC 2010 Smart and Vercauteren presented a variant of Gentry’s fully homomorphic public key encryption scheme and mentioned that the scheme could support SIMD style operations. The slow key generation process of the Smart–Vercauteren system was then addressed in a paper by Gentry and Halevi, but their key generation method appears to exclude the SIMD style operation alluded to by Smart and V...