Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 11
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Energy efficiency and reduction of building consumption are deeply felt issues both at Italian and international level. The recent regulatory framework sets stringent limits on energy performance of buildings. Awaiting the adoption of these principles, several methods have been developed to solve the problem of energy consumption of buildings, among which the simplified energy audit is intended to identify any anomalies in the building system, to provide helpful tips for energy refurbishments and to raise end users’ awareness. The Energy Signature is an operational tool of these methodologies, an evaluation method in which energy consumption is correlated with climatic variables, representing the actual energy behaviour of the building. In addition to that purpose, the Energy Signature can be used as an empirical tool to determine the real performances of the technical elements. The latter aspect is illustrated in this article.

Go to article

Authors and Affiliations

L. Belussi
L. Danza
I. Meroni
F. Salamone
Download PDF Download RIS Download Bibtex

Abstract

We propose the proxy threshold signature scheme with the application of elegant construction of verifiable delegating key in the ID-based infrastructure, and also with the bilinear pairings. The protocol satisfies the classical security requirements used in the proxy delegation of signing rights. The description of the system architecture and the possible application of the protocol in edge computing designs is enclosed.
Go to article

Bibliography

[1] A. Boldyreva, ”Threshold signatures, multi-signatures and blind signatures based on the Gap Diffie-Hellman Group signature scheme”, LNCS, vol. 2567, pp. 31-44, 2003.
[2] D. Boneh, C. Gentry, H. Shacham, B. Lynn, ”Short signatures from the Weil pairing”, Journal of Cryptology, vol. 17, no. 4, pp. 297-319, 2004.
[3] D. Boneh, C. Gentry, H. Shacham, B. Lynn, ”Aggregate and verifiably encrypted signatures from bilinear pairing”, Proceedings of Eurocrypt 2003, LNCS 2656, pp. 416-432, 2003.
[4] Y. Desmedt, ”Society and group oriented cryptography”, Crypto 87, pp. 120-127, 1987.
[5] Y. Desmedt, Y. Frankel, ”Threshold cryptosystems”, LNCS, vol. 718, pp. 1-14, 1993.
[6] D. E. Kouicem, A. Bouabdallah, H. Lakhlef, ”Internet of things security: A top-down survey”, 2018
[7] W. Gao, G. Wang, X. Wang, Z. Yang, ”One-Round ID-Based Threshold Signature Scheme from Bilinear Pairings”, Informatica, Vol. 20, No. 4, pp. 461-476, 2009.
[8] K. Itakura, K. Nakamura, ”A public key cryptosystem suitable for digital multisignatures”, NEC Research and Development, pp. 1-8, vol. 71, 1983.
[9] A. Joux, ”A one-round protocol for tripartite Diffie-Hellman”, Journal of Cryptology, vol. 17, no. 4, pp. 263-276, 2004.
[10] S. Kim, S. Park, D. Won, ”Proxy signatures, revisited”, LNCS, vol. 1334, pp. 223-232, 1997.
[11] A. Lysyanskaya, ”Unique signatures and verifiable random functions from the DH-DDH separation”, Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, pp. 597-612, 2002.
[12] M. Mambo, K. Usuda, E. Okamoto, ”Proxy signatures for delegating signing operation”, ACM Conference on Computer and Communications Security, pp. 48-57, 1996.
[13] A. Manzoor, M. Liyanagey, A. Braekenz, S. Kanherex, M. Ylianttila, ”Blockchain based Proxy Re-Encryption Scheme for Secure IoT Data Sharing”, 2018.
[14] B.C. Neuman, ”Proxy-based authorization and accounting for distributed systems”, Proceedings of the 13th International Conference on Distributed Computing Systems, pp. 283-291, 1993.
[15] K.G. Paterson, ”ID-based signatures from pairings on elliptic curves”, Journals and Magazines, Electronics Letters, Volume: 38 Issue: 18, pp. 1025 - 1026, 2002.
[16] J. Pomykała and T Warchoł, ”Threshold signatures in dynamic groups”, Proceedings of Future Generation Communication and Networking, IEEE Computer Science, pp. 32-37, 2007.
[17] J. Pomykała, B. ´ Zrałek, ”A model of ID-based proxy signature scheme”, Proc. of 6-th Collecter Iberoamerica, pp. 1-8, 2008.
[18] A. Shamir, ”How to share a secret”, Communications of the ACM, 22:612-613, 1979.
[19] N. Suryadevara and S. Mukhopadhyay, ”Internet of things: A review and future perspective” Reliance, 2018.
[20] R. Taylor, D. Baron, and D. Schmidt, ”The world in 2025-predictions for the next ten years”, Microsystems, Packaging, Assembly and Circuits Technology Conference (IMPACT), 2015 10th International. IEEE, pp. 192–195, 2015.
[21] V. Varadharajan, P. Allen, S. Black, ”An analysis of the proxy problem in distributed systems”, Proc. IEEE Computer Society Symposium on Research in Security and Privacy, pp. 255-275, 1991.
[22] H. Watanabe, S. Fujimura, A. Nakadaira, Y. Miyazaki, A. Akutsu, and J. Kishigami, ”Blockchain contract: Securing a blockchain applied to smart contracts”, Consumer Electronics (ICCE), 2016 IEEE International Conference on. IEEE, pp. 467–468, 2016.
[23] Z. Zheng, S. Xie, H. Dai, X. Chen, and H. Wang, ”An overview of blockchain technology: Architecture, consensus, and future trends”, Big Data (BigData Congress), 2017 IEEE International Congress IEEE, pp. 557–564, 2017.
Go to article

Authors and Affiliations

Jacek Pomykała
1
Henryk Kułakowski
1
Piotr Sapiecha
2
Błażej Grela
1

  1. Warsaw University of Technology, Poland
  2. National Institute of Telecommunications in Warsaw, Poland
Download PDF Download RIS Download Bibtex

Abstract

In general, currently employed vehicle classification algorithms based on the magnetic signature can distinguish among only a few vehicle classes. The work presents a new approach to this problem. A set of characteristic parameters measurable from the magnetic signature and limits of their uncertainty intervals are determined independently for each predefined class. The source of information on the vehicle parameters is its magnetic signature measured in a system that enables independent measurement of two signals, i.e. changes in the active and reactive component of the inductive loop impedance caused by a passing vehicle. These innovations result in high selective classification system, which utilizes over a dozen vehicle classes. The evaluation of the proposed approach was carried out for good vehicles consisting of 2-axle tractor and a 3-axle semi-trailer.

Go to article

Authors and Affiliations

Janusz Gajda
Marek Stencel
Download PDF Download RIS Download Bibtex

Abstract

In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.

Go to article

Authors and Affiliations

Mariusz Jurkiewicz
Download PDF Download RIS Download Bibtex

Abstract

This paper presents a Kalman filter based method for diagnosing both parametric and catastrophic faults in analog circuits. Two major innovations are presented, i.e., the Kalman filter based technique, which can significantly improve the efficiency of diagnosing a fault through an iterative structure, and the Shannon entropy to mitigate the influence of component tolerance. Both these concepts help to achieve higher performance and lower testing cost while maintaining the circuit.s functionality. Our simulations demonstrate that using the Kalman filter based technique leads to good results of fault detection and fault location of analog circuits. Meanwhile, the parasitics, as a result of enhancing accessibility by adding test points, are reduced to minimum, that is, the data used for diagnosis is directly obtained from the system primary output pins in our method. The simulations also show that decision boundaries among faulty circuits have small variations over a wide range of noise-immunity requirements. In addition, experimental results show that the proposed method is superior to the test method based on the subband decomposition combined with coherence function, arisen recently.

Go to article

Authors and Affiliations

Xifeng Li Li
Yongle Xie
Dongjie Bi
Yongcai Ao
Download PDF Download RIS Download Bibtex

Abstract

The work proposes a new method for vehicle classification, which allows treating vehicles uniformly at the stage of defining the vehicle classes, as well as during the classification itself and the assessment of its correctness. The sole source of information about a vehicle is its magnetic signature normalised with respect to the amplitude and duration. The proposed method allows defining a large number (even several thousand) of classes comprising vehicles whose magnetic signatures are similar according to the assumed criterion with precisely determined degree of similarity. The decision about the degree of similarity and, consequently, about the number of classes, is taken by a user depending on the classification purpose. An additional advantage of the proposed solution is the automated defining of vehicle classes for the given degree of similarity between signatures determined by a user. Thus the human factor, which plays a significant role in currently used methods, has been removed from the classification process at the stage of defining vehicle classes. The efficiency of the proposed approach to the vehicle classification problem was demonstrated on the basis of a large set of experimental data.

Go to article

Authors and Affiliations

J. Gajda
M. Mielczarek
Download PDF Download RIS Download Bibtex

Abstract

The article is devoted to the method facilitating the diagnostics of dynamic faults in networks of interconnection in systems-on-chips. It shows how to reconstruct the erroneous test response sequence coming from the faulty connection based on the set of signatures obtained as a result of multiple compaction of this sequence in the MISR register with programmable feedback. The Chinese reminder theorem is used for this purpose. The article analyzes in detail the various hardware realizations of the discussed method. The testing time associated with each proposed solution was also estimated. Presented method can be used with any type of test sequence and test pattern generator. It is also easily scalable to any number of nets in the network of interconnections. Moreover, it supports finding a trade-off between area overhead and testing time.
Go to article

Authors and Affiliations

Tomasz Garbolino
Download PDF Download RIS Download Bibtex

Abstract

In this paper we construct and consider a new group-based digital signature scheme with evolving secret key, which is built using a bilinear map. This map is an asymmetric pairing of Type 3, and although, for the reason of this paper, it is treated in a completely abstract fashion it ought to be viewed as being actually defined over E(Fqn)[p] × E(Fqnk )[p] → Fqnk [p]. The crucial element of the scheme is the key updater algorithm. With the adoption of pairings and binary trees where a number of leaves is the same as a number of time periods, we are assured that an updated secret key can not be used to recover any of its predecessors. This, in consequence, means that the scheme is forward-secure. To formally justify this assertion, we conduct analysis in fu-cma security model by reducing the security of the scheme to the computational hardness of solving the Weak ℓ-th Bilinear Diffie-Hellman Inversion problem type. We define this problem and explain why it can be treated as a source of security for cryptographic schemes. As for the reduction itself, in general case, it could be possible to make only in the random oracle model.
Go to article

Bibliography

[1] A. Anderson, Invited lecture, in Fourth Annual Conference on Computer and Communications Security, ACM, Am Psychiatric Assoc, 1997.
[2] M. Bellare and S. K. Miner, ”A Forward-Secure Digital Signature Scheme”, in Advances in Cryptology - CRYPTO ’99, 19th Annual International Cryptology Conference, 1999, pp. 431–449, doi: 10.1007/3-540-48405-128.
[3] D. Boneh and X. Boyen, ”Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles”, in Advances in Cryptology - EUROCRYPT 2004, C. Cachin and J.L. Camenisch, Eds. 2004, pp. 223- 238.
[4] D. Boneh, X. Boyen and E.-J. Goh, ”Hierarchical Identity Based Encryption with Constant Size Ciphertext”, Cryptology ePrint Archive, Report 2005/015. [Online]. Available: https://eprint.iacr.org/2005/015.pdf.
[5] X. Boyen, H. Shacham, E. Shen and B. Waters, ”Forward Secure Signatures with Untrusted Update”, in Proceedings of CCS 2006, W. Rebecca Ed. 2006, pp. 191–200.
[6] J. Buchmann, E. Dahmen and A. H¨ulsing, ”XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions”, in Post-Quantum Cryptography, B.-Y. Yang, Ed. 2011, pp. 117–129.
[7] J. Camenisch and M. Koprowski, ”Fine-grained Forward-secure Signature Schemes without Random Oracles”, Discrete Applied Mathematics, vol. 154, no. 2, pp. 175–188, Feb. 2006, doi: 10.1016/j.dam.2005.03.028.
[8] R. Canetti, S. Halevi, J. Katz, ”A Forward-Secure Public-Key Encryption Scheme”, in Advances in Cryptology - EUROCRYPT 2003, E. Biham, Ed. 2003, pp. 255–271.
[9] Y. Cui, E. Fujisaki, G. Hanaoka, H. Imai and R. Zhang, ”Formal Security Treatments for Signatures from Identity-Based Encryption”, in Provable Security, W. Susilo, J. K. Liu, Y. Mu, Eds. 2007, pp. 218–227.
[10] A. Fiat and A. Shamir, ”How to Prove Yourself: Practical Solutions to Identification and Signature Problems”, in Conference on the theory and application of cryptographic techniques, 1986, pp. 186–194.
[11] S. D. Galbraith, K. G. Paterson and N. P. Smart, ”Pairings for Cryptographers”, Discrete Applied Mathematics, vol. 156, no. 16, pp. 3113 - 3121, Sep. 2008, doi: 10.1016/j.dam.2007.12.010.
[12] S. Goldwasser S. Micali and R. L. Rivest, ”A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks”, SIAM Journal on Computing, vol. 17, no. 2, pp. 281–308, 1988, doi: 10.1137/0217017.
[13] S. Hohenberger and B.Waters, ”New Methods and Abstractions for RSA-Based Forward Secure Signatures”, in International Conference on Applied Cryptography and Network Security, M. Conti, J. Zhou, E. Casalicchio and Angelo Spognardi, Eds. 2020, pp. 292–312.
[14] G. Itkis, and L. Reyzin, ”Forward-secure Signatures with Optimal Signing and Verifying”, in Advances in Cryptology - CRYPTO ’01, 21st Annual International Cryptology Conference, J. Kilian, Ed. 2001, pp. 332–354.
[15] M. Jurkiewicz, ”Improving Security of Existentially Unforgeable Signature Schemes”, International Journal of Electronics and Telecommunications, vol. 66, no. 3, pp. 473–480, 2020, doi: 10.24425/ijet.2020.131901.
[16] H. Krawczyk, ”Simple Forward-secure Signatures from any Signature Scheme”, in Proceedings of the 7th ACM conference on Computer and Communications Security, P. Samarati, Ed. 2000, pp. 108–115, doi: 10.1145/352600.352617.
[17] S. Mitsunari, R. Sakai and M. Kasahara, ”A new traitor tracing”, IEICE transactions on fundamentals of electronics, communications and computer sciences, vol. 85, no. 2, pp. 481–484, Feb. 2002.
Go to article

Authors and Affiliations

Mariusz Jurkiewicz
1

  1. Faculty of Cybernetics, Military University of Technology, Warsaw, Poland
Download PDF Download RIS Download Bibtex

Abstract

This work is focused on the automatic recognition of environmental noise sources that affect humans’ health and quality of life, namely industrial, aircraft, railway and road traffic. However, the recognition of the latter, which have the largest influence on citizens’ daily lives, is still an open issue. Therefore, although considering all the aforementioned noise sources, this paper especially focuses on improving the recognition of road noise events by taking advantage of the perceived noise differences along the road vehicle pass-by (which may be divided into different phases: approaching, passing and receding). To that effect, a hierarchical classification scheme that considers these phases independently has been implemented. The proposed classification scheme yields an averaged classification accuracy of 92.5%, which is, in absolute terms, 3% higher than the baseline (a traditional flat classification scheme without hierarchical structure). In particular, it outperforms the baseline in the classification of light and heavy vehicles, yielding a classification accuracy 7% and 4% higher, respectively. Finally, listening tests are performed to compare the system performance with human recognition ability. The results reveal that, although an expert human listener can achieve higher recognition accuracy than the proposed system, the latter outperforms the non-trained listener in 10% in average.

Go to article

Authors and Affiliations

Xavier Valero
Francesc Alías
Download PDF Download RIS Download Bibtex

Abstract

This paper presents mechanical fault detection in squirrel cage induction motors (SCIMs) by means of two recent techniques. More precisely, we have analyzed the rolling element bearing (REB) faults in SCIM. Rolling element bearing faults constitute a major problem among different faults which cause catastrophic damage to rotating machinery. Thus early detection of REB faults in SCIMs is of crucial importance. Vibration analysis is among the key concepts for mechanical vibrations of rotating electrical machines. Today, there is massive competition between researchers in the diagnosis field. They all have as their aim to replace the vibration analysis technique. Among them, stator current analysis has become one of the most important subjects in the fault detection field. Motor current signature analysis (MCSA) has become popular for detection and localization of numerous faults. It is generally based on fast Fourier transform (FFT) of the stator current signal. We have detailed the analysis by means of MCSA-FFT, which is based on the stator current spectrum. Another goal in this work is the use of the discrete wavelet transform (DWT) technique in order to detect REB faults. In addition, a new indicator based on the MCSA-DWT technique has been developed in this study. This new indicator has the advantage of expressing itself in the quantity and quality form. The acquisition data are presented and a comparative study is carried out between these recent techniques in order to ensure a final decision. The proposed subject is examined experimentally using a 3 kW squirrel cage induction motor test bed.

Go to article

Authors and Affiliations

N. Bessous
S. Sbaa
A.C. Megherbi
Download PDF Download RIS Download Bibtex

Abstract

In a smart city environment, Intelligent Transportation System (ITS) enables the vehicle to generate and communicate messages for safety applications. There exists a challenge where the integrity of the message needs to be verified before passing it on to other vehicles. There should be a provision to motivate the honest vehicles who are reporting the true event messages. To achieve this, traffic regulations and event detections can be linked with blockchain technology. Any vehicle violating traffic rules will be issued with a penalty by executing the smart contract. In case any accident occurs, the vehicle nearby to the spot can immediately send the event message to Unmanned Aerial Vehicle (UAV). It will check for its credibility and proceed with rewards. The authenticity of the vehicle inside the smart city area is verified by registering itself with UAVs deployed near the city entrance. This is enabled to reduce the participation of unauthorized vehicles inside the city zone. The Secure Hash Algorithm (SHA256) and Elliptic Curve Digital Signature Algorithm (ECDSA-192) are used for communication. The result of computation time for certificate generation and vehicles involvement rate is presented.
Go to article

Authors and Affiliations

Suganthi Evangeline
1
Ashmiya Lenin
2
Vinoth Babu Kumaravelu
3

  1. Department of Electronics and Communication Engineering, Karunya Institute of Technology and Sciences, Coimbatore, India
  2. PG Scholar in Communication Systems, Karunya Institute of Technology and Sciences, Coimbatore, India
  3. School of Electronics Engineering, VIT University, Vellore, India

This page uses 'cookies'. Learn more