Projects per year
Abstract
Group signatures are an important privacy-enhancing tool that allow to anonymously sign messages on behalf of a group. A recent feature for group signatures is controllable linkability, where a dedicated linking authority (LA) can determine whether two given signatures stem from the same signer without being able to identify the signer(s). Currently the linking authority is fully trusted, which is often not desirable.
In this paper, we firstly introduce a generic technique for non-interactive zero-knowledge plaintext equality and inequality proofs. In our setting, the prover is given two ciphertexts and some trapdoor information, but neither has access to the decryption key nor the randomness used to produce the respective ciphertexts. Thus, the prover performs these proofs on unknown plaintexts. Besides a generic technique, we also propose an efficient instantiation that adapts recent results from Blazy et al. (CT-RSA'15), and in particular a combination of Groth-Sahai (GS) proofs (or sigma proofs) and smooth projective hash functions (SPHFs).
While this result may be of independent interest, we use it to realize verifiable controllable linkability for group signatures. Here, the LA is required to non-interactively prove whether or not two signatures link (while it is not able to identify the signers). This significantly reduces the required trust in the linking authority. Moreover, we extend the model of group signatures to cover the feature of verifiable controllable linkability.
In this paper, we firstly introduce a generic technique for non-interactive zero-knowledge plaintext equality and inequality proofs. In our setting, the prover is given two ciphertexts and some trapdoor information, but neither has access to the decryption key nor the randomness used to produce the respective ciphertexts. Thus, the prover performs these proofs on unknown plaintexts. Besides a generic technique, we also propose an efficient instantiation that adapts recent results from Blazy et al. (CT-RSA'15), and in particular a combination of Groth-Sahai (GS) proofs (or sigma proofs) and smooth projective hash functions (SPHFs).
While this result may be of independent interest, we use it to realize verifiable controllable linkability for group signatures. Here, the LA is required to non-interactively prove whether or not two signatures link (while it is not able to identify the signers). This significantly reduces the required trust in the linking authority. Moreover, we extend the model of group signatures to cover the feature of verifiable controllable linkability.
Original language | English |
---|---|
Title of host publication | Topics in Cryptology - CT-RSA 2016 - The Cryptographer's Track at the RSA Conference 2016, San Francisco, CA, USA, 2016. Proceedings. |
Publisher | Springer Verlag |
Pages | 127-143 |
Volume | 9610 |
Edition | LNCS |
DOIs | |
Publication status | Published - 2016 |
Event | Topics in Cryptology – The Cryptographer's Track at the RSA Conference 2016: CT-RSA 2016 - San Francisco, United States Duration: 29 Feb 2016 → 4 Mar 2016 |
Conference
Conference | Topics in Cryptology – The Cryptographer's Track at the RSA Conference 2016 |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 29/02/16 → 4/03/16 |
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Theoretical
Fingerprint
Dive into the research topics of 'Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability'. Together they form a unique fingerprint.Projects
- 2 Finished
-
EU - PrismaCloud - PRIvacy and Security MAintaining services in the CLOUD
Derler, D., Hanser, C., Lipp, P., Slamanig, D. & Rechberger, C.
1/01/15 → 30/06/18
Project: Research project
-
SeCoS - Secure Contactless Sphere - Smart RFID-Technologies for a Connected World
Bösch, W., Wenger, E., Khan, H. N., Schmidt, J., Gadringer, M. E., Spreitzer, R. C., Mendel, F., Gruss, D., Hutter, M., Freidl, P. F., Görtschacher, L. J., Mangard, S. & Grosinger, J.
1/01/13 → 31/12/15
Project: Research project