Apr 27, 2016 · Abstract: The problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work.
Abstract. The problem of revocation in anonymous authentication systems is subtle and has motivated a lot of work. One of the preferable solutions consists ...
On the Efficiency of Revocation in RSA-Based Anonymous Systems by Maria Fueyo, Javier Herranz published in IEEE Transactions on Information Forensics.
A satisfactory solution to this problem has been an interesting question for some time, especially in a situation where the users in the system are anonymous.
We provide a construction of a dynamic accumulator and an efficient zero-knowledge proof of knowledge of an accumulated value. We prove their security under the ...
Baric and Pfitzmann [BP97] give an efficient construction of the so-called collision-resistant accumulators, based on the strong RSA assumption. We propose ...
Dynamic Accumulators and Application to ... - ResearchGate
www.researchgate.net › ... › Credentialing
Jan 10, 2024 · In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie ...
We propose Braavos, a new, RSA-based, dynamic accumulator. It has optimal communication complexity and, when combined with efficient zero-knowledge proofs ...
In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption ...
Jan 24, 2017 · We propose Braavos, a new,. RSA-based, dynamic accumulator. It has optimal communication complexity and, when combined with efficient zero- ...