Anonymous Homomorphic IBE with Application to Anonymous Aggregation

نویسندگان

چکیده

All anonymous identity-based encryption (IBE) schemes that are group homomorphic (to the best of our knowledge) require knowledge identity to compute operation. This paper is motivated by this open problem, namely construct an group-homomorphic IBE scheme does not sacrifice anonymity perform operations. Note even when strong assumptions, such as indistinguishability obfuscation (iO), permitted, no known. We succeed in solving problem assuming iO and hardness DBDH over rings (specifically, ZN2 for RSA modulus N). then use existence a with re-randomizable keys, which we prove be IND-ID-RCCA secure. Finally, results aggregation protocols.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homomorphic Cryptography Based Anonymous Routing

The impressive development of ubiquitous systems and anywhere, anytime communications is faces security issues that prevent this industry from growing any further. Because of the properties of these systems, it is especially difficult to prevent users’ private information leakage such as the users’ identities or the relations between users. In the world of mobile ad hoc networks (MANETs), ad ho...

متن کامل

Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts

Lewko and Waters [Eurocrypt 2010] presented a fully secure HIBE with short ciphertexts. In this paper we show how to modify their construction to achieve anonymity. We prove the security of our scheme under static (and generically secure) assumptions formulated in composite order bilinear groups. In addition, we present a fully secure Anonymous IBE in the secret-key setting. Secret-Key Anonymou...

متن کامل

Anonymous IBE from Quadratic Residuosity with Improved Performance

Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity. The latter is an attractive basis for an IBE owing to the fact that it is a well-understood hard problem from number theory. Cocks constructed the first such scheme, and subsequent improvements have been made to achieve anonymity and improve space efficiency. However, the anonymous v...

متن کامل

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions

In anonymous identity-based encryption (IBE), ciphertexts not only hide their corresponding messages, but also their target identity. We construct an anonymous IBE scheme based on the Computational Diffie-Hellman (CDH) assumption in general groups (and thus, as a special case, based on the hardness of factoring Blum integers). Our approach extends and refines the recent tree-based approach of C...

متن کامل

Universally Anonymous IBE Based on the Quadratic Residuosity Assumption

We introduce the first universally anonymous, thus key-private, IBE whose security is based on the standard quadratic residuosity assumption. Our scheme is a variant of Cocks IBE (which is not anonymous) and is efficient and highly parallelizable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography

سال: 2023

ISSN: ['2410-387X']

DOI: https://doi.org/10.3390/cryptography7020022