You are here

Anonymous t-out-of-N Threshold Signature Schemes

Title: Anonymous t-out-of-N Threshold Signature Schemes.
53 views
15 downloads
Name(s): Maneva-Jakimoska, Karolina, author
Burmester, Mike, professor directing thesis
Yasinsac, Alec, committee member
De Medeiros, Breno, committee member
Department of Computer Science, degree granting department
Florida State University, degree granting institution
Type of Resource: text
Genre: Text
Issuance: monographic
Date Issued: 2006
Publisher: Florida State University
Place of Publication: Tallahassee, Florida
Physical Form: computer
online resource
Extent: 1 online resource
Language(s): English
Abstract/Description: 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. Group signatures were the first signatures to provide anonymity of the signer(s): the members of the group can anonymously sign messages on behalf of the group using specially designed keys. The keys used by the individual members of the group are generated and distributed by a trusted group manager. Hence, group signatures are suitable for cooperative groups that have some preexisting structure. They are not suitable for groups that can be formed in an ad-hoc manner. To solve this problem, Rivest, Shamir and Tauman (ASIACRYPT 2001) introduced the notion of ring signature schemes. Unlike group signatures, ring signatures have no group managers. Any user can select a set (ring) of possible signers that includes himself, and using his private key and the public key of the other member of the ring, he can sign on behalf of the ring. Bresson, Stern and Szydlo (CRYPTO 2002) extend the notion to a threshold setting where some minimum number t of members of the group has to cooperate in order to sign a message. The complexity of the threshold ring signature scheme proposed by Bresson et al is prohibitively large even for relatively small sets of signers.
Identifier: FSU_migr_etd-2755 (IID)
Submitted Note: A Thesis submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Science.
Degree Awarded: Spring Semester, 2006.
Date of Defense: April 3, 2006.
Keywords: Covering Design, Anonymity, Threshold Signature Schemes, Vandermonde Matrix
Bibliography Note: Includes bibliographical references.
Advisory Committee: Mike Burmester, Professor Directing Thesis; Alec Yasinsac, Committee Member; Breno de Medeiros, Committee Member.
Subject(s): Computer science
Persistent Link to This Record: http://purl.flvc.org/fsu/fd/FSU_migr_etd-2755
Owner Institution: FSU

Choose the citation style.
Maneva-Jakimoska, K. (2006). Anonymous t-out-of-N Threshold Signature Schemes. Retrieved from http://purl.flvc.org/fsu/fd/FSU_migr_etd-2755