Back to Results
First PageMeta Content
Finite fields / Cryptographic protocols / Group signature / Diffie–Hellman key exchange / Digital signature / Computational Diffie–Hellman assumption / ElGamal encryption / Diffie–Hellman problem / Schnorr signature / Cryptography / Computational hardness assumptions / Public-key cryptography


A Practical and Provably Secure Coalition-Resistant Group Signature Scheme Giuseppe Ateniese1 , Jan Camenisch2 , Marc Joye3 , and Gene Tsudik4
Add to Reading List

Document Date: 2000-10-24 11:52:18


Open Document

File Size: 400,41 KB

Share Result on Facebook

City

Baltimore / /

Company

The Model Group / IBM / /

Country

United States / /

Currency

pence / /

/

Event

FDA Phase / /

Facility

The Johns Hopkins University / University of California / /

Holiday

Assumption / /

IndustryTerm

probabilistic algorithm / registration protocol / SIGN algorithm / probabilistic polynomial-time algorithm / probabilistic polynomial-time algorithms / knowledge protocols / e-cash / /

Organization

The Johns Hopkins University / Department of Computer Science / Department of Information and Computer Science / University of California / Irvine / Practical and Provably Secure Coalition / /

Person

Ai / /

Position

one of the colluding group members / manager / manager the product / designated group manager / group manager / /

Product

FiatShamir / FO98 / /

ProgrammingLanguage

R / /

ProvinceOrState

Maryland / /

Technology

all 3-move protocols / Our JOIN protocol / public key / SIGN algorithm / JOIN protocol / probabilistic polynomial-time algorithms / secret key / probabilistic polynomial-time algorithm / corresponding interactive protocols / digital signature / knowledge protocols / probabilistic algorithm / registration protocol / interactive protocol / resulting protocol / /

SocialTag