Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors

EUROCRYPT, pp. 1-31, 2016.

Cited by: 69|Bibtex|Views24|Links
EI

Abstract:

An accumulator is a function that hashes a set of inputs into a short, constant-size string while preserving the ability to efficiently prove the inclusion of a specific input element in the hashed set. It has proved useful in the design of numerous privacy-enhancing protocols, in order to handle revocation or simply prove set membership....More

Code:

Data:

Your rating :
0

 

Tags
Comments