Search

One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a McEliece-type cryptosystem using large minimum distance error-correcting codes derived from self-dual codes. To the best of our knowledge, such codes have not been implemented in a code-based cryptosystem until now. Moreover, we modify the decryption step of the system by introducing a decryption algorithm based on two private keys. We determine the parameters of binary codes with large minimum distance, which, if implemented into a McEliece-type cryptosystem, would provide a security level respectively of 80, 128, and 256 bits. For the 80-bit security case, we construct a large minimum distance self-dual code of length 1064, and use it to derive a random punctured code to be used in the corresponding McEliece-type cryptosystem. Compared to the original McEliece cryptosystem, the key size is reduced by about 38.5%, although an optimal decoding set is yet to be constructed to make the new system fully defined and usable., Cyber Security

This paper presents an approach to designing secure modular authentication framework based on iris biometrics and its’ implementation into mobile banking scenario. The system consists of multiple clients and an authentication server. Client, a smartphone with accompanying application, is used to capture biometrics, manage auxiliary data and create and store encrypted cancelable templates. Bank’s authentication server manages encryption keys and provides the template verification service. Proposed system keeps biometric templates encrypted or at least cancelable during all stages of storage, transmission and verification. As templates are stored on clients in encrypted form and decryption keys reside on bank's authentication server, original plaintext templates are unavailable to an adversary if the phone gets lost or stolen. The system employs public key cryptography and pseudorandom number generator on small-sized templates, thus not suffering from severe computational costs like systems that employ homomorphic encryption. System is also general, as it does do not depend on specific cryptographic algorithms. Having in mind that modern smartphones have iris scanners or at least high- quality front cameras, and that no severe computational drawbacks exist, one may conclude that the proposed authentication framework is highly applicable in mobile banking authentication.

Nowadays, the Internet of Things is able to provide more advanced services to people, which connects a variety of devices, systems and applications. However, it covers a variety of devices, protocols and applications, which makes it much more complex. In the main application areas, wireless sensor networks with a frequent but short communication character, it requires an efficient and flexible protocol to protect the information. To protect the traffic of the Internet of Things is the focal point of this research work. Although many protocols for the Internet have been put forward, it is still not enough to meet the increasingly complex requirements from applications. Many of them are not efficient enough to adapt the device diversity and timely communication environment. This paper is trying to address this problem, by proposing a peer-to-peer security protocol to satisfy this varied environment. Secure communication is implemented on an open sourced platform for the Internet of Things. Its less handshake in future sessions and dynamic security level adjustment feature satisfies the realistic demand on this platform. Finally, with a comparison test, the result shows that the proposed protocol is efficient to meet the specific goals and applicable for the Internet of Things applications. © 2015 IEEE., Export Date: 23 September 2015

With the rapid development of the Internet connected technologies and applications, people are keen on embracing the convenience and practi-­‐‑ calities they brings. As all kinds of technologies improve, the Internet of Things matures and is able to provide more advanced services to people, which connects a variety of devices, systems and applications beyond traditional machine-­‐‑to-­‐‑machine. However, it covers a variety of devices, protocols and applications, which makes it much more complex than a normal network. Nevertheless, equipped with appropriate security solutions, the Internet of Things is promising to bring us more conven-­‐‑ iences and be widely applied in our daily life. And like the main appli-­‐‑ cation areas, wireless sensor networks with a frequent but short com-­‐‑ munication character, it requires an efficient and flexible protocol to protect the information. To protect the traffic of the Internet of Things is the focal point of this research work. Although many protocols for the Internet have been put forward, it is still not enough to meet the increas-­‐‑ ingly complex requirements from applications. Many of them are not efficient enough to adapt the device diversity and timely communica-­‐‑ tion environment. This research work is trying to address this problem, by proposing a peer-­‐‑to-­‐‑peer security protocol to satisfy this varied environment. Secure communication is implemented on an open sourced platform for the Internet of Things. The philosophy of the platform it implemented on is also inherited to this protocol and the implementation. It avoids unnecessary handshakes between entities, which makes it more efficient in a wireless sensor network. Modulariza-­‐‑ tion and unit test are adapted in implementation to enhance the robust of the system. Its dynamic security level adjustment feature satisfies the realistic demand on one platform this protocol is implemented on. Finally, with a comparison test and an analysis using the BAN logic, SensibleThings Platform

With the rapid development of the Internet connected technologies and applications, people are keen on embracing the convenience and practi-­‐‑ calities they brings. As all kinds of technologies improve, the Internet of Things matures and is able to provide more advanced services to people, which connects a variety of devices, systems and applications beyond traditional machine-­‐‑to-­‐‑machine. However, it covers a variety of devices, protocols and applications, which makes it much more complex than a normal network. Nevertheless, equipped with appropriate security solutions, the Internet of Things is promising to bring us more conven-­‐‑ iences and be widely applied in our daily life. And like the main appli-­‐‑ cation areas, wireless sensor networks with a frequent but short com-­‐‑ munication character, it requires an efficient and flexible protocol to protect the information. To protect the traffic of the Internet of Things is the focal point of this research work. Although many protocols for the Internet have been put forward, it is still not enough to meet the increas-­‐‑ ingly complex requirements from applications. Many of them are not efficient enough to adapt the device diversity and timely communica-­‐‑ tion environment. This research work is trying to address this problem, by proposing a peer-­‐‑to-­‐‑peer security protocol to satisfy this varied environment. Secure communication is implemented on an open sourced platform for the Internet of Things. The philosophy of the platform it implemented on is also inherited to this protocol and the implementation. It avoids unnecessary handshakes between entities, which makes it more efficient in a wireless sensor network. Modulariza-­‐‑ tion and unit test are adapted in implementation to enhance the robust of the system. Its dynamic security level adjustment feature satisfies the realistic demand on one platform this protocol is implemented on. Finally, with a comparison test and an analysis using the BAN logic, SensibleThings Platform

With the widespread adoption of XML as the message format to disseminate content over distributed systems including Web Services and Publish-Subscribe systems, different methods have been proposed for securing messages. We focus on a subset of such systems where incremental updates are disseminated. The goal of this paper is to develop an approach for disseminating only the updated or accessible portions of XML content while assuring confidentiality and integrity at message level. While sending only the updates greatly reduces the bandwidth requirements, it introduces the challenge of assuring security efficiently for partial messages disseminated to intermediaries and clients. We propose a novel localized encoding scheme based on conventional cryptographic functions to enforce security for confidentiality and content integrity at the granularity of XML node level. We also address structural integrity with respect to the complete XML document to which clients have access. Our solution takes every possible measure to minimize indirect information leakage by making the rest of the structure of XML documents to which intermediaries and clients do not have access oblivious. The experimental results show that our scheme is superior to conventional techniques of securing XML documents when the percentage of update with respect to original documents is low.

With the widespread adoption of XML as the message format to disseminate content over distributed systems including Web Services and Publish-Subscribe systems, different methods have been proposed for securing messages. We focus on a subset of such systems where incremental updates are disseminated. The goal of this paper is to develop an approach for disseminating only the updated or accessible portions of XML content while assuring confidentiality and integrity at message level. While sending only the updates greatly reduces the bandwidth requirements, it introduces the challenge of assuring security efficiently for partial messages disseminated to intermediaries and clients. We propose a novel localized encoding scheme based on conventional cryptographic functions to enforce security for confidentiality and content integrity at the granularity of XML node level. We also address structural integrity with respect to the complete XML document to which clients have access. Our solution takes every possible measure to minimize indirect information leakage by making the rest of the structure of XML documents to which intermediaries and clients do not have access oblivious. The experimental results show that our scheme is superior to conventional techniques of securing XML documents when the percentage of update with respect to original documents is low.

With the widespread adoption of XML as the message format to disseminate content over distributed systems including Web Services and Publish-Subscribe systems, different methods have been proposed for securing messages. We focus on a subset of such systems where incremental updates are disseminated. The goal of this paper is to develop an approach for disseminating only the updated or accessible portions of XML content while assuring confidentiality and integrity at message level. While sending only the updates greatly reduces the bandwidth requirements, it introduces the challenge of assuring security efficiently for partial messages disseminated to intermediaries and clients. We propose a novel localized encoding scheme based on conventional cryptographic functions to enforce security for confidentiality and content integrity at the granularity of XML node level. We also address structural integrity with respect to the complete XML document to which clients have access. Our solution takes every possible measure to minimize indirect information leakage by making the rest of the structure of XML documents to which intermediaries and clients do not have access oblivious. The experimental results show that our scheme is superior to conventional techniques of securing XML documents when the percentage of update with respect to original documents is low.

With the widespread adoption of XML as the message format to disseminate content over distributed systems including Web Services and Publish-Subscribe systems, different methods have been proposed for securing messages. We focus on a subset of such systems where incremental updates are disseminated. The goal of this paper is to develop an approach for disseminating only the updated or accessible portions of XML content while assuring confidentiality and integrity at message level. While sending only the updates greatly reduces the bandwidth requirements, it introduces the challenge of assuring security efficiently for partial messages disseminated to intermediaries and clients. We propose a novel localized encoding scheme based on conventional cryptographic functions to enforce security for confidentiality and content integrity at the granularity of XML node level. We also address structural integrity with respect to the complete XML document to which clients have access. Our solution takes every possible measure to minimize indirect information leakage by making the rest of the structure of XML documents to which intermediaries and clients do not have access oblivious. The experimental results show that our scheme is superior to conventional techniques of securing XML documents when the percentage of update with respect to original documents is low.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Tato práce se zabývá problematikou postranních kanálu v kryptografii. Úvodní část popisuje základní členění oboru kryptologie. Dále jsou zmíněné požadavky na kryptografický systém z hlediska bezpečnosti. V další kapitole jsou popsány základní algoritmy a protokoly, které se používají v kryptografii. Hlavní část práce se zaměřuje na problematiku postranních kanálů. Závěr práce demonstruje útok časovým postraním kanálem na algoritmus RSA., This work deals with a problem called sidelong cannals in cryptografy. First part describes basic segmentation of cryptografy branch. In addition to this the document mentions some requirements for cryptology system from security angle. In another section basic algorithms and protocols are described which are used in cryptology. Main part of this work is aimed at sidelong cannals problem. Conclusion of this task demonstrates an attack by time-side canal to algorithm RSA.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Tato práce se zabývá problematikou postranních kanálu v kryptografii. Úvodní část popisuje základní členění oboru kryptologie. Dále jsou zmíněné požadavky na kryptografický systém z hlediska bezpečnosti. V další kapitole jsou popsány základní algoritmy a protokoly, které se používají v kryptografii. Hlavní část práce se zaměřuje na problematiku postranních kanálů. Závěr práce demonstruje útok časovým postraním kanálem na algoritmus RSA., This work deals with a problem called sidelong cannals in cryptografy. First part describes basic segmentation of cryptografy branch. In addition to this the document mentions some requirements for cryptology system from security angle. In another section basic algorithms and protocols are described which are used in cryptology. Main part of this work is aimed at sidelong cannals problem. Conclusion of this task demonstrates an attack by time-side canal to algorithm RSA.

Tato práce se zabývá problematikou postranních kanálu v kryptografii. Úvodní část popisuje základní členění oboru kryptologie. Dále jsou zmíněné požadavky na kryptografický systém z hlediska bezpečnosti. V další kapitole jsou popsány základní algoritmy a protokoly, které se používají v kryptografii. Hlavní část práce se zaměřuje na problematiku postranních kanálů. Závěr práce demonstruje útok časovým postraním kanálem na algoritmus RSA., This work deals with a problem called sidelong cannals in cryptografy. First part describes basic segmentation of cryptografy branch. In addition to this the document mentions some requirements for cryptology system from security angle. In another section basic algorithms and protocols are described which are used in cryptology. Main part of this work is aimed at sidelong cannals problem. Conclusion of this task demonstrates an attack by time-side canal to algorithm RSA.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Tato práce se zabývá problematikou postranních kanálu v kryptografii. Úvodní část popisuje základní členění oboru kryptologie. Dále jsou zmíněné požadavky na kryptografický systém z hlediska bezpečnosti. V další kapitole jsou popsány základní algoritmy a protokoly, které se používají v kryptografii. Hlavní část práce se zaměřuje na problematiku postranních kanálů. Závěr práce demonstruje útok časovým postraním kanálem na algoritmus RSA., This work deals with a problem called sidelong cannals in cryptografy. First part describes basic segmentation of cryptografy branch. In addition to this the document mentions some requirements for cryptology system from security angle. In another section basic algorithms and protocols are described which are used in cryptology. Main part of this work is aimed at sidelong cannals problem. Conclusion of this task demonstrates an attack by time-side canal to algorithm RSA.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Pojmy osobní údaje a ochrana osobních údajů doprovázejí běžný společenský život v České republice teprve pár let. V oblasti ochrany osobních údajů je nutné přijímat opatření k zamezení zneužití osobních údajů a tím se vyvarovat následnému postihu. Problematika ochrany osobních údajů je složitá, diskuse a polemiky jsou vedeny i ve sdělovacích prostředcích., The terms personal data and personal data protection have accopmanied ordinary social life of people in the Czech Republic only for several years. In the area of personal data protection it is necessary to receive measures to prevent misuse of personal data and thereby to avoid resulting sanction. Problems of personal data protection is complicated, discussion and polemics are held even in media.

Tato práce se zabývá problematikou postranních kanálu v kryptografii. Úvodní část popisuje základní členění oboru kryptologie. Dále jsou zmíněné požadavky na kryptografický systém z hlediska bezpečnosti. V další kapitole jsou popsány základní algoritmy a protokoly, které se používají v kryptografii. Hlavní část práce se zaměřuje na problematiku postranních kanálů. Závěr práce demonstruje útok časovým postraním kanálem na algoritmus RSA., This work deals with a problem called sidelong cannals in cryptografy. First part describes basic segmentation of cryptografy branch. In addition to this the document mentions some requirements for cryptology system from security angle. In another section basic algorithms and protocols are described which are used in cryptology. Main part of this work is aimed at sidelong cannals problem. Conclusion of this task demonstrates an attack by time-side canal to algorithm RSA.