Earticle

초록

영어

Network coding signature schemes can be employed to pre- vent malicious modification of data in network transition. But existing network coding signature schemes are only suitable for linear network coding. To adapt to nonlinear network coding, in this paper we introduce the concept of nonlinear network coding signature scheme and its un- forgeability, and propose a unforgeable nonlinear network coding scheme based on the hardness of the small integer solution (SIS) problem in lattice-based cryptography. We first present an improvement on the theorem which presented the unforgeability of a signature scheme without identifiers proposed by David Cash et.al. in EURO- CRYPT 2010. Then a nonlinear network coding signature scheme is designed, and its unforgeability is proved by employing the Chinese remainder theorem. Thus the scheme can be used to provide cryptographic protection in nonlinear network coding.

목차

Abstract
 1. Introduction
 2. Preliminaries
 3. The nonlinear network coding signature scheme based on the SIS problem and its unforgeability
  3.1. The nonlinear network coding signature scheme
  3.2. Unforgeability
 4. Conclusion
 5. Acknowledgments
 References

키워드

저자

• Yanqing Yao, [ State Key Laboratory of Software Development Environment, Beihang University ]
• Zhoujun Li [ School of Computer Science and Engineering, Beihang University ]
• Hua Guo [ Beijing Key Laboratory of Network Technology, Beihang University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605