K. Maneva-Jakimoska

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The anonymity provided by the threshold ring signature scheme proposed by Bresson et al (Crypto’02) is perfect. However, its complexity is prohibitively large even for relatively small sets of signers. We propose use of threshold schemes based on covering designs that are efficient for large groups of signers. The cost we pay is non-perfect anonymity.
In many multi-user cryptographic applications (e.g., electronic voting, digital lotteries, e-cash application, anonymous access to some resources, etc.), anonymity pops up as one of the main security objectives. Protecting private information about the involved users is not only desirable but crucial for existence and proper working of these applications.(More)
  • 1