Some applications of signcryption schemes to distributed protocols

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 28, Issue 9, 2005, Pages 1421-1430

  Chen, Wei Dong ^a,b   Feng, Deng Guo ^c  

^a GRADUATE SCHOOL   (China)

^b INSTITUTE OF ELECTRONICS   (China)

^c INSTITUTE OF SOFTWARE   (China)

Author keywords

Distributed key generation protocols; Provable security; Random Oracle model; Signcryption; Threshold signcryption schemes

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COSTS; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; THEOREM PROVING; THRESHOLD LOGIC;

AUTHENTICATION CHANNELS; DISTRIBUTED PROTOCOLS; KEY GENERATION; PRIVATE CHANNELS; PROVABLE SECURITY; RANDOM ORACLE MODELS; THRESHOLD SIGNCRYPTION; TRUSTED CENTERS; VERIFIABLE SECRET SHARING; ZERO KNOWLEDGE;

CRYPTOGRAPHY;

EID: 25844494267     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Desmedt Y.. Some recent research aspects of threshold cryptography. In: Okamoto E., Davida G., Mambo M. eds.. Information Security. Lecture Notes in Computer Science 1396. Berlin: Springer-Verlag. 1997, 158-173
2. Canetti R., Gennaro R., Jarecki S., Krawczyk H., Rabin T.. Adaptive security for threshold cryptosystems. In: Wiener M. ed.. Proceedings of Advances in Cryptology-CRYPTO '99. Berlin: Springer-Verlag, 1999, 98-115
3. Needham R., Schroeder M.. Using encryption for authentication in large networks of computers. Communications of the ACM, 1978, 21(12): 993-999
4. Bellare M., Rogaway P.. Provably secure session key distribution-The three party case. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, Las Vegas, Nevada, USA, 1995, 57-66
5. Naor M., Pinkas B., Reingold O.. Distributed pseudo-random functions and KDCs. In: Jacques ed.. Advances in Cryptology-Eurocrypt '99. Lecture Notes in Computer Science 1592. Berlin: Springer-Verlag, 1999, 327-346
6. Daza V., Herranz J., Padro C., Saez G.. A distributed and computationally secure key distribution scheme. In: Chan A. H., Gliger V. eds.. Information Security. Lecture Notes in Computer Science 2433. Berlin: Springer, 2002, 342-356
7. Zheng Y.. Digital signcryption or how to achieve cost (signature and encryption) ≪ cost(signature) + cost(encryption). In: Burton S., Kaliski Jr. eds.. Advanced in Cryptology-CRYPTO'97. Lecture Notes in Computer Science 1294. Berlin: Springer, 1997. 165-179
8. Zheng Y., Imai H.. Using signcryption to build compact and unforgettable key establishment over an ATM network. In: Proceedings of IEEE INFOCOM'98, San Francisco, CA, USA, 1998. 411-418
9. Shamir A.. How to share a secret. Communications of the ACM, 1979, 22(11): 612-613
10. Bellare M., Rogaway P.. Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, USA, 1993, 62-73
11. Gennaro R., Jarecki S., Krawczyk H., Rabin T.. The security of distributed key generation in log-based Cryptosystems. In: Jacques ed.. Advances in Cryptology-Eurocrypt '99. Lecture Notes in Computer Science 1592. Berlin: Springer-Verlag, 1999, 295-310
12. Pedersen T.. Non-Interactive and information-theoretic Secure Verifiable secret sharing. In: Feigenbum ed.. Advances in Cryptology-Crypto'91. Lecture Notes in Computer Science 576. Berlin: Springer-Verlag, 1992, 129-140
13. Feldman P.. A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (FOCS'87), Toronto, Canda, 1987, 427-437
14. Goh Eu-Jin, Jarecki S.. A signature scheme as secure as the Diffie-Hellman problem. In: Biliam E. ed.. Advances in Cryptology-EUROCRYPT 2003. Lecture Notes in Computer Science 2656. Berlin, Springer-Verlag, 2003, 401-415
15. Baek J., Steinfield R., Zheng Y.. Formal proofs for the security of signcryption. In: Naccade D., Pailler P. eds.. Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC 2002). Lecture Notes in Computer Science 2274. Berlin: Springer-Verlag, 2002, 80-98
16. Okamoto T., Pointcheval D.. The gap-problems: A new class of problems for the security of cryptographic schemes. In: Kim K. ed.. Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptosystems(PKC 2001). Lecture Notes in Computer Science 1992. Berlin: Springer-Verlag, 2001, 104-118