Pairing-free equality test over short ciphertexts
نویسندگان
چکیده
منابع مشابه
Fully Secure HIBE with Short Ciphertexts
We construct a fully secure HIBE scheme with short ciphertexts. The previous con-struction of Boneh, Boyen, and Goh was only proven to be secure in the selective model,under a non-static assumption which depended on the depth of the hierarchy. To obtainfull security, we apply the dual system encryption concept recently introduced by Waters.A straightforward application of this t...
متن کاملAdaptively Secure Broadcast Encryption with Short Ciphertexts
We propose an adaptively secure broadcast encryption scheme with short ciphertexts, where the size of broadcast encryption message is fixed regardless of the size of the broadcast group. In our proposed scheme, members can join and leave the group without requiring any change to public parameters of the system or private keys of existing members. Our construction has a twofold improvement over ...
متن کاملPrivacy-Preserving Equality Test
Many countries around the globe are investing on e-healthcare increasingly, which offers tremendous benefits to all stakeholders in healthcare. Nevertheless, this technology introduces unprecedented privacy concerns toward patients and raise more uncertainty among them to use e-healthcare for monitoring their vital signs. These concerns necessitate finding scientific solutions, which enable e-h...
متن کاملCo-operative Private Equality Test
We study the following problem: party A’s secret input is a, party B ’s secret input is b, and party C ’s input is empty; they want to know if a = b with restriction that A and B should not learn anything more than what is implied by their secret inputs and the comparison result, and C should not learn anything about a or b except if a = b. This problem can be seen as a variant of the socialist...
متن کاملTightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts
We provide a tight security proof for an IND-CCA RingLWE based Key Encapsulation Mechanism that is derived from a generic construction of Dent (IMA Cryptography and Coding, 2003). Such a tight reduction is not known for the generic construction. The resulting scheme has shorter ciphertexts than can be achieved with other generic constructions of Dent or by using the well-known Fujisaki-Okamoto ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2017
ISSN: 1550-1477,1550-1477
DOI: 10.1177/1550147717715605