We propose a new construction for format-preserving encryption. Our design provides the flexibility use in encryption (FPE) and static table-driven tokenization. algorithm is substitution-permutation network based on random Sboxes. Using pseudorandom generators functions, we prove strong adaptive security super-pseudorandom permutation assumption of our core design. obtain empirical parameters ...

Data anonymization is used to remove user specific information from published data sets. Different kinds of anonymization techniques are used to eliminate various types of attacks. Anonymization process modifies the data into human unidentifiable form and it is most efficient than any other privacy preserving techniques like encryption etc. Encryption is costly when compared to anonymization as...

We propose a variant of the Paillier cryptosystem that improves efficiency in encryption, re-encryption and decryption while preserving the homomorphic property. We then use this variant to construct a new verifiable shuffle system and prove its security. We show that the new shuffle scheme has the least number of rounds and exponentiations compared to all known shuffle schemes. Finally, we sho...

BACKGROUND Record linkage of existing individual health care data is an efficient way to answer important epidemiological research questions. Reuse of individual health-related data faces several problems: Either a unique personal identifier, like social security number, is not available or non-unique person identifiable information, like names, are privacy protected and cannot be accessed. A s...

An increase in cloud-based computing leads to an increased worry in the security of user data. Typically, data is sent to a third-party server which performs analytics or machine learning on the data. However, in most of these scenarios, the data involved is sensitive and should remain private. Homomorphic encryption, a form of encryption that allows functions to be performed on encrypted ciphe...

We will look into privacy preserving biometrics using the example of a fingerprint reader and partially homomorphic encryption. Therefore we will cover the basics necessary to understand the discussed subject, partially homomorphic encryption and fingerprint based authentication, as well as showing a concrete protocol and its implications on performance and security of the system. While securit...

Hierarchical inner product encryption (HIPE) and spatial encryption (SE) are two important classes of functional encryption (FE) that have numerous applications. Although HIPE and SE both involve some notion of linear algebra, the former works in vectors while the latter is based on (affine) spaces. Moreover, they currently possess different properties in terms of security, anonymity (payload/a...

In this paper we present the first CCA-secure public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular, it does not use hashfunctions or interpret group elements as bit-strings. This makes our scheme a perfect building block for cryptographic protocols where parties for instance want to prove properties about ciphertext...

The bloom filter method for privacy preserving record linkage [24] has been shown to be both efficient, and provide equivalent linkage quality to that achievable with unencoded identifiers [23]. However in some situations, the bloom filter method may be vulnerable to frequency attacks, which could potentially leak identifying information [18]. In this paper we extend the bloom filter protocol t...

The privacy preserving multiset union (PPMU) protocol allows a set of parties, each with a multiset, to collaboratively compute a multiset union secretly, meaning that any information other than union is not revealed. We propose an efficient PPMU protocol, using multiplicative homomorphic property of ElGamal encryption over Fq[x]/f(x) where q is a prime and f(x) is an irreducible polynomial ove...