Efficient identification scheme based on discrete logarithm assumption

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications

Volumn 24, Issue 1, 2001, Pages 52-55

  Zhong, M ^a   Yang, Y X ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Discrete logarithm assumption; Identification scheme; Secret communications

Indexed keywords

ALGEBRA; CRYPTOGRAPHY; DATA PRIVACY; NETWORK PROTOCOLS; PROBABILITY; SECURITY OF DATA;

BIT COMMITMENT; DISCRETE LOGARITHM ASSUMPTION; IDENTIFICATION PROTOCOLS; INITIALIZATION PROTOCOLS; SCHNORR ONETIME KNOWLEDGE PROOF SCHEME; SECRET COMMUNICATION; SINGLE CHALLENGE NUMBER;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 0035267816     PISSN: 10075321     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. How to prove yourself: Practical solution to identification and signature problems
2. Fast signature generation with a fiat Shamir-like scheme
3. An efficient divisible electronic cash scheme
4. Statistical zero knowledge protocols to prove modular polynomial relations
5. Efficient identification and signatures for smart cards
6. Zero knowledge proofs of identity