Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability

DOI10.1007/978-3-319-29485-8_8zbMath1332.94059OpenAlexW2405015847MaRDI QIDQ2799010

Olivier Blazy, David Derler, Raphael Spreitzer, Daniel Slamanig

Publication date: 8 April 2016

Published in: Topics in Cryptology - CT-RSA 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29485-8_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Generic plaintext equality and inequality proofs ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ A CCA-full-anonymous group signature with verifiable controllable linkability in the standard model ⋮ Foundations of fully dynamic group signatures

This page was built for publication: Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability