Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 0.699
JCR 5-Year IF: 0.674
Issues per year: 4
Current issue: Feb 2019
Next issue: May 2019
Avg review time: 83 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


2,235,413 unique visits
Since November 1, 2009

No robots online now


SCImago Journal & Country Rank

SEARCH ENGINES - Google Pagerank


Anycast DNS Hosting

 Volume 19 (2019)
     »   Issue 1 / 2019
 Volume 18 (2018)
     »   Issue 4 / 2018
     »   Issue 3 / 2018
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
 Volume 16 (2016)
     »   Issue 4 / 2016
     »   Issue 3 / 2016
     »   Issue 2 / 2016
     »   Issue 1 / 2016
 Volume 15 (2015)
     »   Issue 4 / 2015
     »   Issue 3 / 2015
     »   Issue 2 / 2015
     »   Issue 1 / 2015
  View all issues  


Clarivate Analytics published the InCites Journal Citations Report for 2017. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.699, and the JCR 5-Year Impact Factor is 0.674.

Thomson Reuters published the Journal Citations Report for 2016. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.595, and the JCR 5-Year Impact Factor is 0.661.

With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "BigData - " before the paper title in OpenConf.

Read More »


  1/2013 - 4

A New Privacy-preserving Path Authentication Scheme using RFID for Supply Chain Management

LEE, Y. See more information about LEE, Y. on SCOPUS See more information about LEE, Y. on IEEExplore See more information about LEE, Y. on Web of Science, PARK, Y. See more information about PARK, Y. on SCOPUS See more information about PARK, Y. on SCOPUS See more information about PARK, Y. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (644 KB) | Citation | Downloads: 497 | Views: 2,928

Author keywords
message authentication, identity management systems, RFID tags, security, supply chain management

References keywords
rfid(18), privacy(14), supply(8), percom(8), systems(5), security(5), chains(5), chain(5), authentication(5)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2013-02-28
Volume 13, Issue 1, Year 2013, On page(s): 23 - 26
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2013.01004
Web of Science Accession Number: 000315768300004
SCOPUS ID: 84875336349

Quick view
Full text preview
This paper presents a privacy-preserving path-authentication method for supply chain management using RFID. Compared with previous works, our scheme employs only symmetric encryption and message authentication codes. This reduces computation and communication overhead. The proposed method also supports high-level privacy without the need for tamper-proof tags as compared with the previous methods. Performance analysis demonstrates that the proposed scheme requires far less computation resource than recent works, proving that less than 1 minute is enough to verify 100000 RFIDs in a conventional reader environment.

References | Cited By  «-- Click to see who has cited this paper

[1] E. Blass et al, "Tracker : security and privacy for RFID-based supply chains," Proc. of 18th NDSS Symposium, pp 455-472, 2011, Feb. 6-9.

[2] A. Creazza, "Evaluating logistics network configurations for a global supply chain", Supply Chain Management: An International Journal, 2, 15, pp. 154-164, 2011.
[CrossRef] [SCOPUS Times Cited 8]

[3] F. You, "Optimal Design of Large-Scale Supply Chain with Multi-Echelon Inventory and Risk Pooling under Demand Uncertanty." Computer Aided Chemical Engineering, 19, 26, pp. 991-996, 2009.
[CrossRef] [SCOPUS Times Cited 8]

[4] S. Cai et al, "A New Framework for Privacy of RFID Path Authentication", In Proc. ACNS'12, LNCS vol. 7341, pp. 473-488, 2012.
[CrossRef] [SCOPUS Times Cited 8]

[5] K. Ouafi, and S. Vaudenay, "Pathchecker: an RFID Application for Tracing Products in Supply-Chains," Proceedings of RFID SecÂ’09, pp.1-14 2009, June 30-July 2; Leuven, Belgium.

[6] Y. Li, and X. Ding, "Protecting RFID communications in supply chains," Proc. of ACM CCS'07, pp. 234-241, 2007.
[CrossRef] [SCOPUS Times Cited 80]

[7] EPC Class-1 Generation-2 UHF RFID Protocols for Communications at 860Mhz-960Mhz version 1.2.0, [Online] Available: Temporary on-line reference link removed - see the PDF document

[8] M. Khalfaoui, K. Elkhiyaoui, and R. Molva, "Privacy Preserving Products Tracking in Clustered Supply Chain", Proc. SENSORCOMM'11, pp. 399-404, 2011.

[9] S. Cai, et al, "Distributed Path Authentication for Dynamic RFID-Enabled Supply Chains," IFIP Advances in Information and Communication Technology, Volume 376/2012, pp. 501-512, 2012.
[CrossRef] [SCOPUS Times Cited 9]

[10] S. Weis, S. Sarma, R. Rivest, and D. Engels, "Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems", In Proc. Security in Pervasive Computing, LNCS vol. 2802, pp. 50-59, 2004.

[11] T. Li, W. Luo, Z. Mo, and S. Chen, "Privacy-preserving RFID Authentication based on Cryptographical Encoding" Proc. IEEE INFOCOM'12, pp. 2174-2182, 2012.
[CrossRef] [SCOPUS Times Cited 25]

[12] Q. Yao, Y. Qi, J. Han, J. Zhao, X. Li, and Y. Liu, "Randomizing RFID Private Authentication," Proc. of IEEE PERCOM, 2009.
[CrossRef] [SCOPUS Times Cited 33]

[13] T. Dimitriou, "A Secure and Efficient RFID Protocol that could make Big Brother (partially) Obsolete," Proc. of IEEE PERCOM, 2006.
[CrossRef] [SCOPUS Times Cited 93]

[14] L. Lu, J. Han, L. Hu, Y. Liu, and L. Ni, "Dynamic Key-Updating: Privacy-Preserving Authentication for RFID Systems," Proc. IEEE PERCOM, 2007.
[CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 91]

[15] L. Lu, J. Han, R. Xiao, and Y. Liu, "ACTION: Breaking the Privacy Barrier for RFID Systems," Proc. of IEEE INFOCOM, 2009.
[CrossRef] [Web of Science Times Cited 19] [SCOPUS Times Cited 49]

[16] L. Lu, Y. Liu, and X. Li, "Refresh: Weak Privacy Model for RFID Systems," Proc. of IEEE INFOCOM, 2010.
[CrossRef] [SCOPUS Times Cited 41]

[17] M. Ohkubo, K. Suzuki and S. Kinoshita, "Cryptographic Approach to Privacy-friendly Tags", in Proceedings of RFID Privacy Workshop, MIT, 2003.

[18] M. Ohkubo, K. Suzuki, and S. Kinoshita, "Efficient Hash-Chain based RFID Privacy Protection Scheme", Proc. of UbiComp Workshop Privacy, 2004.

[19] T. Dimitriou, "A Lightweight RFID Protocol to Protect Against Traceability and Cloning Attacks", in Proc. of SecureComm, 2005.
[CrossRef] [Web of Science Times Cited 29] [SCOPUS Times Cited 297]

[20] D. Henrici, P Muller, "Providing Security and Privacy in RFID Systems Using Triggered Hash Chains", Proc. of IEEE PerCom, 2008.
[CrossRef] [Web of Science Times Cited 14] [SCOPUS Times Cited 31]

[21] A. Juels, "RFID Security and Privacy: a Research Survey", Selected Areas in Communication, IEEE Journal on, Vol. 24, No. 2, pp. 381-394, 2006.
[CrossRef] [Web of Science Times Cited 707] [SCOPUS Times Cited 1158]

[22] X. Wang, Y. Yin, and H. Yu, "Finding Collisions in the Full SHA-1", Proc. CRYPTO'05, LNCS vol. 3621, pp. 17-36, 2005.

[23] M. Bellare and P. Rogarway, Lecture notes on applied cryptography.

[24] Crypto++ Library, [Online] Available: Temporary on-line reference link removed - see the PDF document

[25] Certicom Research, "SEC 2: Recommended Elliptic Curve Domain Parameters", Certicom, Sep. 2000.

References Weight

Web of Science® Citations for all references: 779 TCR
SCOPUS® Citations for all references: 1,931 TCR

Web of Science® Average Citations per reference: 30 ACR
SCOPUS® Average Citations per reference: 74 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2019-05-18 04:25 in 114 seconds.

Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2019
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: