[go: up one dir, main page]

Skip to main content

Drug Anti-forgery and Tracing System Based on Lightweight Asymmetric Identities

  • Conference paper
Intelligence and Security Informatics (PAISI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9074))

Included in the following conference series:

  • 1150 Accesses

Abstract

The authors analyze the defects of existent anti-forgery techniques, put forward the idea of applying a lightweight asymmetric identity to fraud guard, and design a drug anti-forgery and tracing system preliminarily. A lightweight asymmetric identity, generated by the optimized REESSE1+ digital signature scheme with an 80-bit modulus, and also called a Board-fingered Identity (BFID), hides the private key of a drug mill, the source information of a drug, and especially the unique number of a drug. A BFID contains only 16 characters with the security of magnitude 2 ^ 80, may be directly printed on the label of a drug concealingly, and does not need to be stored in a chip. The system based on a BFID has effects of anti-forgery, source tracing, and flow-direction tracking, and includes six subsystems: the source information editing subsystem, the key management subsystem, the BFID confection subsystem, the BFID verification subsystem, the source tracing subsystem, and the flow-direction tracking subsystem. When a BFID is verified, it is scratched out, inputted to a mobile phone, and sent to the unified verification platform which works in a cloud computing mode, and is bound to a mobile number. Then, the unified verification platform returns the “True” or “False” value and the source information to the mobile phone of the consumer.

This work is supported by MOST with Project 2007CB311100 and 2009AA01Z441.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Menezes, A., Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, London (2001)

    Google Scholar 

  2. Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd edn. John Wiley & Sons, New York (1996)

    MATH  Google Scholar 

  3. Stallings, W.: Cryptography and Network Security: Principles and Practice, 2nd edn. Prentice-Hall, New Jersey (1999)

    Google Scholar 

  4. Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)

    Book  MATH  Google Scholar 

  5. Ranasinghe, D.C.: Lightweight Cryptography for Low Cost RFID. In: Networked RFID Systems and Lightweight Cryptography, pp. 311–346. Springer (2007)

    Google Scholar 

  6. Shamir, A.: SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 144–157. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  7. Su, S., Lü, S.: A Public Key Cryptosystem Based on Three New Provable Problems. Theoretical Computer Science 426-427, 91–117 (2012)

    Article  Google Scholar 

  8. Su, S., Lü, S., Fan, X.: Asymptotic Granularity Reduction and Its Application. Theoretical Computer Science 412(39), 5374–5386 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  9. Su, S., Lü, S.: REESSE1+ · Reward · Proof by Experiment · A New Approach to Proof of P != NP. Cornell University Library (2009, revised 2014), http://arxiv.org/pdf/0908.0482

  10. Damgård, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)

    Google Scholar 

  11. Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428–446. Springer, Heidelberg (1990)

    Google Scholar 

  12. Su, S., Cai, Y., Shen, C.: The Banknote Anti-forgery System Based on Digital Signature Algorithms. In: Yang, C.C., et al. (eds.) ISI Workshops 2008. LNCS, vol. 5075, pp. 44–49. Springer, Heidelberg (2008)

    Google Scholar 

  13. Goldrich, M.T., Tamassia, R.: Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shenghui Su .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Su, S., Li, N., Lü, S. (2015). Drug Anti-forgery and Tracing System Based on Lightweight Asymmetric Identities. In: Chau, M., Wang, G., Chen, H. (eds) Intelligence and Security Informatics. PAISI 2015. Lecture Notes in Computer Science(), vol 9074. Springer, Cham. https://doi.org/10.1007/978-3-319-18455-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18455-5_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18454-8

  • Online ISBN: 978-3-319-18455-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics