10,557 results
Search Results
2. Securing Information Systems in an Uncertain World Enterprise Level Security (Invited Paper)
- Author
-
William R. Simpson
- Subjects
digital signatures ,public key infrastructure ,attributes ,Access Control ,identity management systems ,high assurance ,cryptography ,enterprise ,authentication ,claims ,Information technology ,T58.5-58.64 ,Communication. Mass media ,P87-96 - Abstract
Increasing threat intrusions to enterprise computing systems have led to a formulation of guarded enterprise systems. The approach was to put in place steel gates and prevent hostile entities from entering the enterprise domain. The current complexity level has made the fortress approach to security implemented throughout the defense, banking, and other high trust industries unworkable. The alternative security approach presented in this paper is the result of a concentrated fourteen year program of pilots and research. Its distributed approach has no need for passwords or accounts and derives from a set of tenets that form the basic security model requirements. At each step in the process it determines identities and claims for access and privileges. These techniques are resilient, secure, extensible, and scalable. They are currently being implemented for a major enterprise, and are a candidate for other enterprise security approaches. This paper discusses the Enterprise Level Security architecture, a web-based security architecture designed to select and incorporate technology into a cohesive set of policies and rules for an enterprise information system. The paper discusses the history, theoretical underpinnings, implementation decisions, current status, and future plans for expansion of capabilities and scale.
- Published
- 2016
3. Rethinking blockchain security: Position paper
- Author
-
Sebastian Ma, Vincent Chia, Pieter H. Hartel, Georgios Piliouras, Pawel Szalachowski, Qingze Hum, Daniel Reijsbergen, and Mark van Staalduinen
- Subjects
FOS: Computer and information sciences ,blockchain ,Internet of things ,Computer Science - Cryptography and Security ,Blockchain ,Computer science ,Techno-economics ,Cryptography ,02 engineering and technology ,security ,Computer security ,computer.software_genre ,smart contracts ,Software testing ,Green computing ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,Protocol (object-oriented programming) ,Different protocols ,business.industry ,Security breaches ,Incentive ,Software deployment ,Position papers ,Position paper ,020201 artificial intelligence & image processing ,business ,Cryptography and Security (cs.CR) ,computer - Abstract
Blockchain technology has become almost as famous for incidents involving security breaches as for its innovative potential. We shed light on the prevalence and nature of these incidents through a database structured using the STIX format. Apart from OPSEC-related incidents, we find that the nature of many incidents is specific to blockchain technology. Two categories stand out: smart contracts, and techno-economic protocol incentives. For smart contracts, we propose to use recent advances in software testing to find flaws before deployment. For protocols, we propose the PRESTO framework that allows us to compare different protocols within a five-dimensional framework., 8 pages, 1 figure, accepted for presentation as a regular paper at IEEE Blockchain 2018 (Halifax, Canada)
- Published
- 2018
4. Critical perspectives on provable security: Fifteen years of 'another look' papers
- Author
-
Neal Koblitz and Alfred Menezes
- Subjects
Provable security ,Algebra and Number Theory ,Computer Networks and Communications ,business.industry ,Applied Mathematics ,020206 networking & telecommunications ,Subject (documents) ,Cryptography ,0102 computer and information sciences ,02 engineering and technology ,Computer security ,computer.software_genre ,Mathematical proof ,01 natural sciences ,Microbiology ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,business ,computer ,Mathematics - Abstract
We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata.
- Published
- 2019
5. REVIEW PAPER ON BITCOIN TECHNOLOGY
- Author
-
Summaya Anwar, Ahthasham Sajid, Haroon Khalid, and Zoraiz Nawaz
- Subjects
Cryptocurrency ,Commerce ,Scope (project management) ,business.industry ,Currency ,Financial asset ,Digital currency ,Payment system ,Cryptography ,business ,Popularity - Abstract
Bitcoin is a cryptocurrency (digitized money) and is a worldwide decentralized payment system that is allowed and kept alive due to the technology called Block Chain. TheTnetworkTconsistsTofTpeer-to-peer transactions and these transactions are verified by using cryptography technology bank. Chain technology keeps the records of public distributed ledger. Bitcoins can be earned as a reward through mining. This currency can is convertible into other currencies, products and services. Bitcoin has been emerging as famous digital currency and getting popularity all over for quick transition. Moreover, bitcoin will be a financial asset because it has profitable results. The purpose of this research study is to explain complete working of bitcoins technology, highlights applications and research challenges to be address and current future international market scope of Bitcoin technology.
- Published
- 2019
6. Review Paper on Cryptography Algorithms Used in Wireless Sensor Networks
- Author
-
H. Kaur and K. Kaur
- Subjects
business.industry ,Computer science ,Cryptography ,business ,Wireless sensor network ,Computer network - Published
- 2018
7. Recipient Privacy in Online Social Networks (Short Paper)
- Author
-
Kimmo Halunen, Bart Mennink, and Filipe Beato
- Subjects
060201 languages & linguistics ,Information privacy ,Social graph ,business.industry ,Computer science ,Privacy software ,InformationSystems_INFORMATIONSYSTEMSAPPLICATIONS ,Data_MISCELLANEOUS ,Short paper ,Internet privacy ,Cryptography ,06 humanities and the arts ,02 engineering and technology ,Encryption ,0602 languages and literature ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Confidentiality ,business - Abstract
Alongside the intensive growth of Online Social Networks (OSNs), privacy has become an important concept and requirement when sharing content online, leading users to enforce privacy often using encryption when sharing content with multiple recipients. Although cryptographic systems achieve common privacy goals such as confidentiality, key privacy, and recipient privacy, they have not been designed aiming at dynamic types of networks. In fact, the interactive nature of OSNs provides adversaries new attack vectors against privacy, and in particular against recipient privacy. We present the notion of frientropy, and argue that privacy of recipients is maintained in OSNs provided that the social graph has a high frientropy, besides the conventional recipient privacy notion. We compute the frientropy for various theoretical settings, and discuss its implications on some practical settings.
- Published
- 2016
8. Research on Digital Steganography and Image Synthesis Model Based on Improved Wavelet Neural Network.
- Author
-
Li, Xujie, Yao, Rujing, and Lee, Jonghan
- Subjects
DIGITAL images ,CRYPTOGRAPHY ,FEEDFORWARD neural networks ,ARTIFICIAL neural networks ,ELECTRONIC paper ,LINEAR network coding ,GENETIC algorithms - Abstract
Network compression coding technology is a research hotspot in the field of digital steganography and image synthesis. How to improve image quality while achieving short compression time is a problem currently faced. Based on the improved wavelet neural network theory, this paper constructs a digital steganography and image synthesis model. The model first tracks the contour of the digit to be recognized, then equalizes and resamples the contour to make it translation-invariant and scaling-invariant, and then uses multi-wavelet neural network clusters to stretch the contour shell to obtain orders of magnitude multi-resolution and its average, and finally, these shell coefficients are fed into a feedforward neural network cluster to identify this handwritten digit, solving the problem of multi-resolution decomposition of contour shells while having a high sampling rate. In the simulation process, the classification model that a single pixel is a text/non-text pixel is trained on the original gray value of the gray pixel and its neighboring pixels, and the classified text pixels are connected to a text area through an adaptive MeanShift method. The experimental results show that it is feasible to use multi-wavelet features for handwritten digit recognition. The model combines the neural network and the genetic algorithm, making full use of the advantages of both, so that the new algorithm has the learning ability and robustness of the neural network. The compression ratio after compression by ordinary wavelet coding, PSNR, MSE, and compression time are 8.4, 25 dB, 210, and 7 s, respectively. The values are 11.7, 24 dB, 207, and 11 s, respectively. At the same time, the peak signal-to-noise ratio is higher and the mean square error is lower, that is, the compression quality is better, and the accuracy of digital steganography and image synthesis is effectively improved. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
9. Guest Editorial: Selected papers from the 24th International Conference on Information Security and Cryptology (ICISC 2021).
- Author
-
Park, Jong Hwan
- Subjects
INFORMATION technology security ,CONFERENCES & conventions ,ELECTRONIC voting ,QUANTUM cryptography ,BLOCK ciphers ,TELECOMMUNICATION systems ,CRYPTOGRAPHY - Abstract
This is our first IET Information Security special issue from the Internation Conference on Information Security and Cryptology, which was held from December 1 to December 3, Seoul, South Korea, 2021. TOPIC B Paper 3 by K. Yamamura, Y. Wang, and E. Fujisaki investigates an enumeration algorithm that is used as a subroutine for the BKZ algorithm, which is one of the most practical reduction algorithms. [Extracted from the article]
- Published
- 2023
- Full Text
- View/download PDF
10. Survey Paper on Digital Image Sharing by Diverse Image Media
- Author
-
Ashwini Udmale and S. B. Nimbekar
- Subjects
021110 strategic, defence & security studies ,Theoretical computer science ,Multimedia ,Computer science ,business.industry ,0211 other engineering and technologies ,Cryptography ,02 engineering and technology ,computer.software_genre ,Secret sharing ,Image (mathematics) ,Digital image ,Information hiding ,Ciphertext ,0202 electrical engineering, electronic engineering, information engineering ,Key (cryptography) ,020201 artificial intelligence & image processing ,Noise (video) ,business ,computer - Abstract
Conventional cryptography is a method of transforming message into an unreadable format called as cipher text. This cipher text can easily be shared over the network without fear but anyone can get message easily by applying key on cipher text. Sharing and delivering secret images over the network is also known as a visual secret sharing (VSS) scheme. However main drawback of VSS scheme is that it is experience from high transmission risk due to the shares are like noise. As the shares are like noise which in turn lead to cause the attackers attention. To solve this problem mechanism is developed called Natural image based visual secret sharing (NVSS). This paper is motivated by need of novel mechanism to transfer the secret images over network. In proposed work for regeneration of secret image a generated noisy share, natural images and seed (needed for random functions used) are required at the receiving end. Though generated share is noisy and its contents are not recognizable, overall structure may be visible in some cases. So data hiding is should be performed on generated share to hide that structure (texture) in noisy share.
- Published
- 2016
11. Review Paper on Wormhole Attack
- Author
-
Garima Kadian and Dinesh Singh
- Subjects
Computer science ,Wireless network ,business.industry ,Data_MISCELLANEOUS ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,Wormhole attack ,Cryptography ,ComputerSystemsOrganization_PROCESSORARCHITECTURES ,Computer security ,computer.software_genre ,Hardware_INTEGRATEDCIRCUITS ,Data mining ,business ,computer - Abstract
A Wireless Networks are more accessible to different types of attack than wired Network. One such attack is Wormhole Attack, in which traffic is forwarded and replayed from one location to another through the Wormhole tunnel without negotiating any cryptographic techniques over the network. Thus, it is challenging to defend against this attack. In this paper we review WSN concept and Wormhole Attack. Then we discuss classification of wormhole Attack and also mention few of the initiatives to detect the Wormhole Attack.
- Published
- 2015
12. Lightweight and Optimized Multi-Layer Data Hiding using Video Steganography Paper
- Author
-
Samar kamil, Masri Ayob, Siti, and Zulkifli Ahmad
- Subjects
Steganalysis ,General Computer Science ,Steganography ,business.industry ,Computer science ,020207 software engineering ,Cryptography ,02 engineering and technology ,Encryption ,Least significant bit ,Computer engineering ,Cipher ,Information hiding ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business ,Avalanche effect - Abstract
The ever-escalating attacks on the internet network are due to rapid technological growth. In order to surmount such challenges, multi-layer security algorithms were developed by hybridizing cryptography and steganography techniques. Consequently, the overall memory size became enormous while hybridizing these techniques. On the other side, the least significant bit (LSB) and modified LSB replacing approaches could provide the variability as detected by steganalysis technique, most found to be susceptible to attack too due to numerous reasons. To overcome these issues, in this paper a lightweight and optimized data hiding algorithm is proposed which consume less memory, provide less variability, and robust against histogram attacks. The proposed steganography system was achieved in two stages. First, data was encrypted using lightweight BORON cipher that only consumed less memory as compared to conventional algorithm such as 3DES, AES. Second, the encrypted data was hidden in the complemented or non-complemented form to obtain minimal variability. The performance of the proposed technique was evaluated in terms of avalanche effect, visual quality, embedding capacity and peak signal to noise ratio (PSNR). The results revealed that the lightweight BORON cipher could produce approximate same avalanche effect as the AES algorithm produced. Furthermore, the value of PSNR had shown much improvement in comparison to optimization algorithm GA.
- Published
- 2018
13. Invited Paper: Secure Boot and Remote Attestation in the Sanctum Processor
- Author
-
Ilia Lebedev, Kyle Hogan, and Srinivas Devadas
- Subjects
business.industry ,Computer science ,Physical unclonable function ,Provisioning ,Cryptography ,02 engineering and technology ,computer.software_genre ,Certificate ,020202 computer hardware & architecture ,Public-key cryptography ,0202 electrical engineering, electronic engineering, information engineering ,Operating system ,020201 artificial intelligence & image processing ,State (computer science) ,Field-programmable gate array ,business ,computer ,Booting - Abstract
© 2018 IEEE. During the secure boot process for a trusted execution environment, the processor must provide a chain of certificates to the remote client demonstrating that their secure container was established as specified. This certificate chain is rooted at the hardware manufacturer who is responsible for constructing chips according to the correct specification and provisioning them with key material. We consider a semi-honest manufacturer who is assumed to construct chips correctly, but may attempt to obtain knowledge of client private keys during the process. Using the RISC-V Rocket chip architecture as a base, we design, document, and implement an attested execution processor that does not require secure non-volatile memory, nor a private key explicitly assigned by the manufacturer. Instead, the processor derives its cryptographic identity from manufacturing variation measured by a Physical Unclonable Function (PUF). Software executed by a bootloader built into the processor transforms the PUF output into an elliptic curve key pair. The (re)generated private key is used to sign trusted portions of the boot image, and is immediately destroyed. The platform can therefore provide attestations about its state to remote clients. Reliability and security of PUF keys are ensured through the use of a trapdoor computational fuzzy extractor. We present detailed evaluation results for secure boot and attestation by a client of a Rocket chip implementation on a Xilinx Zynq 7000 FPGA.
- Published
- 2018
14. The black paper of quantum cryptography: Real implementation problems
- Author
-
Christian Kurtsiefer and Valerio Scarani
- Subjects
Quantum Physics ,General Computer Science ,Computer science ,business.industry ,FOS: Physical sciences ,Key distribution ,Cryptography ,Quantum key distribution ,Computer security ,computer.software_genre ,Field (computer science) ,Theoretical Computer Science ,Quantum cryptography ,Quantum Physics (quant-ph) ,business ,computer ,Quantum ,Physical law - Abstract
The laws of physics play a crucial role in the security of quantum key distribution (QKD). This fact has often been misunderstood as if the security of QKD would be based only on the laws of physics. As the experts know well, things are more subtle. We review the progresses in practical QKD focusing on (I) the elements of trust that are common to classical and quantum implementations of key distribution; and (II) some threats to security that have been highlighted recently, none of which is unredeemable (i.e., in principle QKD can be made secure). This leads us to guess that the field, similar to non-quantum modern cryptography, is going to split in two directions: those who pursue practical devices may have to moderate their security claims; those who pursue ultimate security may have to suspend their claims of usefulness., Small changes and clarifications. This paper still describes the situation of QKD in June 2009, when its first version was sent out; we have mentioned a few developments in a Note added in proof. Accepted in a special issue of "Theoretical Computer Science" (T. Mor and R. Renner, editors)
- Published
- 2014
15. Parallel Search Using Probabilistic DNA Sticker Model to Cryptanyze One Time Pad Polyalphabetic Cipher.
- Author
-
Yaseen, Basim Sahar
- Subjects
CIPHERS ,STICKERS ,NATURAL languages ,DNA ,PARALLEL processing ,CRYPTOGRAPHY - Abstract
Nowadays, it is difficult to imagine a powerful algorithm of cryptography that can continue cryptanalyzing and attacking without the use of unconventional techniques. Although some of the substitution algorithms are old, such as Vigenere, Alberti, and Trithemius ciphers, they are considered powerful and cannot be broken. In this paper we produce the novelty algorithm, by using of biological computation as an unconventional search tool combined with an uninhibited analysis method is the vertical probabilistic model, that makes attacking and analyzing these ciphers possible and very easy to transform the problem from a complex to a linear one, which is a novelty achievement. The letters of the encoded message are processed in the form of segments of equal length, to report the available hardware components. Each letter codon represents a region of the memory strand, and the letters calculated for it are symbolized within the probabilistic model so that each pair has a triple encoding: the first is given as a memory strand encoding and the others are its complement in the sticker encoding; These encodings differ from one region to another. The solution space is calculated and then the parallel search process begins. Some memory complexities are excluded even though they are within the solution paths formed, because the natural language does not contain its sequences. The precision of the solution and the time consuming of access to it depend on the length of the processed text, and the precision of the solution is often inversely proportional to the speed of access to it. As an average of the time spent to reach the solution, a text with a length of 200 cipher characters needs approximately 15 minutes to give 98% of the correct components of the specific hardware. The aim of the paper is to transform OTP substitution analysis from a NP problem to a O(nm) problem, which makes it easier to find solutions to it easily with the available capabilities and to develop methods that are harnessed to attack difficult and powerful ciphers that differ in class and type from the OTP polyalphabetic substitution ciphers. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Privacy Preserving Association Rule Mining using Horizontally Partition Data: Review Paper
- Author
-
Arpita B. Modh
- Subjects
Association rule learning ,business.industry ,Computer science ,Data stream mining ,Homomorphic encryption ,Cryptography ,computer.software_genre ,Partition (database) ,Paillier cryptosystem ,Information sensitivity ,Data mining ,business ,computer ,Right to privacy - Abstract
Data mining is used to extract interested pattern or knowledge from large amount of data using many data mining technique. However it may also display sensitive information about individuals compromising the individual right to privacy When a collection of data is split among various parties. Now Each and Every party would wants to keep its sensitive information private during the mining process. Privacy preserving data mining is to develop data mining method without increases the risk of misuse of data. The main aim of privacy preserving data mining is to find the global mining results by preserving the individual sites private data/information. The various methods such as randomization, perturbation, heuristic and cryptography techniques. To Find privacy pre serving association rule mining in horizontally and vertically partitioned databases. In this paper, the analysis of different methods for PPARM is performed and their results are compared. Horizontally Partitioned databases, algorithm that combines advantage of both RSA public key cryptosystem and Homomorphic encryption scheme and algorithm that uses Paillier cryptosystem to compute global supports are used. This paper reviews the wide methods used for mining association rules over horizontally distributed dataset while preserving privacy.
- Published
- 2015
17. A research Paper on Cryptography Encryption and Compression Techniques
- Author
-
Sarita Kumari
- Subjects
Neural cryptography ,Theoretical computer science ,business.industry ,Computer science ,Data security ,020206 networking & telecommunications ,Cryptography ,02 engineering and technology ,Information security ,Computer security ,computer.software_genre ,Encryption ,Symmetric-key algorithm ,Strong cryptography ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business ,computer ,Signcryption - Abstract
Data is any type of stored digital information. Security is about the protection of assets. Data security refers to protective digital privacy measures that are applied to prevent unauthorized access to computers, personal databases and websites. Cryptography is evergreen and developments. Cryptography protects users by providing functionality for the encryption of data and authentication of other users. Compression is the process of reducing the number of bits or bytes needed to represent a given set of data. It allows saving more data. Cryptography is a popular ways of sending vital information in a secret way. There are many cryptographic techniques available and among them AES is one of the most powerful techniques. The scenario of present day of information security system includes confidentiality, authenticity, integrity, nonrepudiation. The security of communication is a crucial issue on World Wide Web. It is about confidentiality, integrity, authentication during access or editing of confidential internal documents.
- Published
- 2017
18. Cryptographic Assumptions: A Position Paper
- Author
-
Shafi Goldwasser and Yael Tauman Kalai
- Subjects
Cryptographic primitive ,Theoretical computer science ,business.industry ,Cryptography ,0102 computer and information sciences ,02 engineering and technology ,Cryptographic protocol ,Computer security ,computer.software_genre ,Mathematical proof ,01 natural sciences ,Computational hardness assumption ,Field (computer science) ,Random oracle ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Security of cryptographic hash functions ,business ,computer ,Mathematics - Abstract
The mission of theoretical cryptography is to define and construct provably secure cryptographic protocols and schemes. Without proofs of security, cryptographic constructs offer no guarantees whatsoever and no basis for evaluation and comparison. As most security proofs necessarily come in the form of a reduction between the security claim and an intractability assumption, such proofs are ultimately only as good as the assumptions they are based on. Thus, the complexity implications of every assumption we utilize should be of significant substance, and serve as the yard stick for the value of our proposals. Lately, the field of cryptography has seen a sharp increase in the number of new assumptions that are often complex to define and difficult to interpret. At times, these assumptions are hard to untangle from the constructions which utilize them. We believe that the lack of standards of what is accepted as a reasonable cryptographic assumption can be harmful to the credibility of our field. Therefore, there is a great need for measures according to which we classify and compare assumptions, as to which are safe and which are not. In this paper, we propose such a classification and review recently suggested assumptions in this light. This follows the footsteps of Naor Crypto 2003. Our governing principle is relying on hardness assumptions that are independent of the cryptographic constructions.
- Published
- 2015
19. Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes<xref ref-type="fn" rid="fn1">1</xref><fn id="fn1"><label>1</label><p>The paper is registered to the ORCID of Olav Geil. For more details please visit ...
- Author
-
Geil, Olav, Martin, Stefano, Matsumoto, Ryutaroh, Ruano, Diego, and Luo, Yuan
- Subjects
- *
HAMMING codes , *CODING theory , *ALGEBRAIC geometric codes , *LINEAR codes , *CRYPTOGRAPHY - Abstract
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper, we elaborate on the implication of these parameters and devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes, our bound is often tight. Furthermore, for these codes, the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
20. Errorless robust JPEG steganography using steganographic polar codes.
- Author
-
Zhang, Jimin, He, Xiaolei, and Cao, Yun
- Subjects
JPEG (Image coding standard) ,CRYPTOGRAPHY ,QUALITY factor ,PROBLEM solving - Abstract
Recently, a robust steganographic algorithm that achieves errorless robustness against JPEG recompression has been proposed. The method employs a lattice embedding scheme and utilizes the syndrome-trellis code (STC) for practical embedding. However, we have noticed that errorless robust embedding with STC may encounter failures due to modifications on wet coefficients, especially when a high quality factor is used by the compression channel. To solve this problem, we have discovered that using steganographic polar code (SPC) for embedding has better performance in avoiding modifications on wet coefficients. In this paper, we conduct theoretical analysis to prove the better performance of SPC in wet paper embedding. We establish the condition of avoiding modifications on wet coefficients, followed by presenting a recursive calculation method for determining the distribution of columns in the generator matrix of SPC. The findings reveal that SPC can avoid modifications on wet coefficients under a larger number of wet coefficients compared with STC, and therefore we propose a better errorless robust embedding method employing SPC. The experimental results demonstrate that under close security performance, the proposed method achieves a higher success rate compared with embedding with STC. Specifically, when the quality factor of the compressor is 95 and the payload size is 0.4 bpnzac, our method achieves a success rate of 99.85%, surpassing the 91.95% success rate of the embedding with STC. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. Executing large-scale processes in a blockchain
- Author
-
Ramkumar, Mahalingam
- Published
- 2018
- Full Text
- View/download PDF
22. Guest editorial: selected papers from ICIMCS 2013
- Author
-
Gang Hua, Cees G. M. Snoek, Meng Wang, and Ke Lu
- Subjects
Multimedia ,Computer Networks and Communications ,Computer science ,business.industry ,Cryptography ,computer.software_genre ,Computer graphics ,Hardware and Architecture ,Media Technology ,business ,computer ,Computer communication networks ,Software ,Information Systems - Published
- 2014
23. E-Coin-Based Priced Oblivious Transfer with a Fast Item Retrieval.
- Author
-
Sebé, Francesc and Simón, Sergi
- Subjects
TRANSFER pricing ,CONSUMERS ,MERCHANTS ,ELECTRONIC commerce - Abstract
Priced oblivious transfer (POT) is a cryptographic protocol designed for privacy-preserving e-commerce of digital content. It involves two parties: the merchant, who provides a set of priced items as input, and a customer, who acquires one of them. After the protocol has run, the customer obtains the item they chose, while the merchant cannot determine which one. Moreover, the protocol guarantees that the customer gets the content only if they have paid the price established by the merchant. In a recent paper, the authors proposed a POT system where the payments employed e-coin transactions. The strong point of the proposal was the absence of zero-knowledge proofs required in preceding systems to guarantee the correctness of payments. In this paper, we propose a novel e-coin-based POT system with a fast item retrieval procedure whose running time does not depend on the number of items for sale. This is an improvement over the aforementioned existing proposal whose execution time becomes prohibitively long when the catalog is extensive. The use of zero-knowledge proofs is neither required. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. New Variations of Discrete Logarithm Problem.
- Author
-
Mahdavi, Mahdi, Khaleghifard, Sahar, and Ahmadian, Zahra
- Subjects
PUBLIC key cryptography ,LOGARITHMS ,CRYPTOGRAPHY ,SECURITY systems - Abstract
The security of public key cryptography relies on the complexity of certain mathematical hard problems. It is vital to comprehend the intricacy of these problems to develop secure cryptographic schemes and security protocols. This paper provides an overview of some widely recognized hard problems associated with the discrete logarithm problem, including the reductions among them. Furthermore, we introduce a novel hard problem that is equivalent to the discrete logarithm problem, which also has a decisional version. Additionally, a set of new problems is presented, which can be instrumental in the design of secure encryption schemes. This paper is intended to provide crucial insights into the realm of hard problems in cryptography, facilitating a better understanding of security measures. [ABSTRACT FROM AUTHOR]
- Published
- 2023
25. History, decoded.
- Author
-
Howgego, Joshua
- Subjects
MONOGRAMS ,COMPUTER vision ,CRYPTOGRAPHY - Abstract
Features The Vatican's archives contain thousands of manuscripts that are encrypted BEATA MEGYESI strode past the Pontifical Swiss Guards, in their Renaissance-era uniforms. Then there are ciphers that involve translations of letters, for example swapping the first and last letters of every word before you can read the plaintext. Lasry showed that Bourbon used a cipher that is neither polyphonic nor homophonic, but polyhomophonic - in other words, some of its individual cipher symbols can represent several plaintext letters, but equally each plaintext letter can be represented by several different cipher symbols. Megyesi had the opportunity to use the Vatican's encrypted papers for a project with an audacious goal: to fully automate the process of decrypting historical ciphers so that many thousands of otherwise inaccessible letters could finally speak to us from down the centuries. [Extracted from the article]
- Published
- 2023
- Full Text
- View/download PDF
26. Machine Learning and Applied Cryptography.
- Author
-
Anees, Amir, Hussain, Iqtadar, Khokhar, Umar M., Ahmed, Fawad, and Shaukat, Sajjad
- Subjects
MACHINE learning ,CRYPTOGRAPHY ,MESSAGE authentication codes ,DEEP learning ,SPAM email ,ANALYTIC network process ,REINFORCEMENT learning - Abstract
In the paper entitled "Spam Detection Approach for Secure Mobile Message Communication Using Machine Learning Algorithms", L. G. Jun et al. proposed the applications of the machine learning-based spam detection method for accurate detection. The data extraction process of the review showed that (1) latent Dirichlet allocation topic modeling is among the widely used machine learning algorithms in the selected studies and (2) precision and recall are amongst the most utilized evaluation methods for measuring the performance of these machine learning algorithms. Machine learning (ML) and cryptography have many things in common, for instance, the amount of data to be handled and large search spaces. [Extracted from the article]
- Published
- 2022
- Full Text
- View/download PDF
27. Methods and Challenges of Cryptography-Based Privacy-Protection Algorithms for Vehicular Networks.
- Author
-
Li, Yijing, Bi, Ran, Jiang, Nan, Li, Fengqiu, Wang, Mingsi, and Jing, Xiangping
- Subjects
SMART devices ,TELECOMMUNICATION ,INTERNET security ,ALGORITHMS ,WIRELESS communications ,COMPUTER network security ,COMMUNICATION of technical information ,DATA privacy - Abstract
With the rapid development of wireless communication technology, positioning technology, and modern smart devices, Internet of Vehicles (IoVs) smart vehicles have brought great convenience to human production and life. Meanwhile, privacy and security issues are becoming extremely serious, with serious consequences if sensitive data such as vehicle location and trip patterns are leaked. This paper focuses on the demands for vehicular network security, especially privacy protection and existing privacy-protection techniques, including common cryptography methods and cryptography-based advanced technologies. At the same time, this paper also analyzes the advantages and challenges of these technologies in protecting privacy and network security in the Internet of Vehicles, such as the challenges of computational resource requirements and security efficiency in the implementation process, as well as the complexity of realizing effective privacy protection in the interactions among different entities. Finally, this paper envisions the development of privacy-preserving application scenarios and the prospects for crypotography-based privacy-preserving technologies. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. On a class of permutation trinomials over finite fields.
- Author
-
GÜLMEZ TEMÜR, Burcu and ÖZKAYA, Buket
- Subjects
FINITE fields ,CRYPTOGRAPHY ,POLYNOMIALS - Abstract
In this paper, we study the permutation properties of the class of trinomials of the form f(x) = x
4q+1 + λ1 xq+4 + λ2 x2q+3 ∈ Fq² [x] where λ1 , λ2 ∈ Fq and they are not simultaneously zero. We find all necessary and sufficient conditions on λ1 and λ2 such that f(x) permutes Fq² , where q is odd and q = 22k+1 , k ∈ N. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
29. Enhancing Security with Multi-level Steganography: A Dynamic Least Significant Bit and Wavelet-Based Approach.
- Author
-
Abuali, Mohammed Sabri, Rashidi, C. B. M., Raof, Rafikha Aliana A., Azir, Ku Nurul Fazira Ku, Hussein, Safa Saad, and Abd-Alhasan, Ahmed Q.
- Subjects
CRYPTOGRAPHY ,DIGITAL communications ,SIGNAL-to-noise ratio ,DATA integrity ,ERROR rates ,INVISIBILITY - Abstract
This paper introduces a novel approach to enhancing multi-level security using steganography, a method of concealing information within non-secret data. This paper introduces an innovative approach to multi-level security enhancement using steganography, the art of concealing information within non-obvious data. Our proposed method uniquely combines Dynamic Least Significant Bit (DLSB) steganography with Wavelet Obtained Weights (WOW) steganographic algorithms, forging a sophisticated and adaptable system for secret data embedding. In our enhanced approach, we start by embedding text into an image using an optimized version of DLSB steganography. This refined technique adapts intelligently to the image's local contrast, thereby preserving its visual quality and ensuring the integrity of the embedded information. Subsequently, the payload image is merged with a cover image through the WOW algorithm. This step optimally selects pixels for data embedding, creating a steganographic image that is virtually indistinguishable from the original. The novelty of our work lies in the seamless integration of these two advanced steganographic techniques, which significantly elevates the security and invisibility aspects beyond the current state-of-the-art methods in digital steganography. For validation, we utilized a pretrained MobileNet model to differentiate between original and stego images. This model plays a crucial role in demonstrating the indetectability of our method, achieving an impressive accuracy of 85% in distinguishing stego images from their originals. Our rigorous testing across various metrics — including Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Bit Error Rate (BER), and Mean Squared Error (MSE) — showcases the effectiveness of our approach. The results indicate a robust performance, marking a significant advancement in secure digital communication. In this paper, we focus primarily on the detailed presentation of our results and the significant contributions of our current research, setting a strong foundation for future exploration in increasing robustness against steganalysis and improving the statistical invisibility of the steganography process. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Enhancing Smart Communication Security: A Novel Cost Function for Efficient S-Box Generation in Symmetric Key Cryptography.
- Author
-
Kuznetsov, Oleksandr, Poluyanenko, Nikolay, Frontoni, Emanuele, and Kandiy, Sergey
- Subjects
COST functions ,BLOCK ciphers ,STREAM ciphers ,TELECOMMUNICATION systems ,CRYPTOGRAPHY ,ROCK glaciers ,COMPUTATIONAL complexity - Abstract
In the realm of smart communication systems, where the ubiquity of 5G/6G networks and IoT applications demands robust data confidentiality, the cryptographic integrity of block and stream cipher mechanisms plays a pivotal role. This paper focuses on the enhancement of cryptographic strength in these systems through an innovative approach to generating substitution boxes (S-boxes), which are integral in achieving confusion and diffusion properties in substitution–permutation networks. These properties are critical in thwarting statistical, differential, linear, and other forms of cryptanalysis, and are equally vital in pseudorandom number generation and cryptographic hashing algorithms. The paper addresses the challenge of rapidly producing random S-boxes with desired cryptographic attributes, a task notably arduous given the complexity of existing generation algorithms. We delve into the hill climbing algorithm, exploring various cost functions and their impact on computational complexity for generating S-boxes with a target nonlinearity of 104. Our contribution lies in proposing a new cost function that markedly reduces the generation complexity, bringing down the iteration count to under 50,000 for achieving the desired S-box. This advancement is particularly significant in the context of smart communication environments, where the balance between security and performance is paramount. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Survey of research on confidential computing.
- Author
-
Feng, Dengguo, Qin, Yu, Feng, Wei, Li, Wei, Shang, Ketong, and Ma, Hongzhan
- Subjects
DATA security ,COMPUTER network security ,GROUPWARE (Computer software) ,INTERNET security ,DATA protection - Abstract
As the global data strategy deepens and data elements accelerate integrating and flowing more rapidly, the demand for data security and privacy protection has become increasingly prominent. Confidential computing emerges as a crucial security technology to solve security and privacy problem, and it is also a hot subject of in contemporary security technologies. Leveraging collaborative security in both hardware and software, it builds a trusted execution environment to ensure confidentiality and integrity protection for data in use. This paper provides a comprehensive overview of the development process of confidential computing, summarizing its current research status and issues, which focuses on the security requirements for data security and privacy protection. Furthermore, it deeply analyses the common technical features of confidential computing, and proposes a trusted confidential computing architecture based on collaborative hardware and software trust. Then, it elaborates on the research status and issues of confidential computing from four aspects: hardware security, architecture and key technologies, applications, and standards and evaluation. Finally, this paper provides a synthesis and outlook for the future development of confidential computing. In summary, confidential computing is currently in a rapidly developing stage and will play an important role in cyber security in the future. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. A Secure Architecture to Protect the Network from Replay Attacks during Client-to-Client Data Transmission.
- Author
-
Nadeem, Muhammad, Arshad, Ali, Riaz, Saman, Zahra, Syeda Wajiha, Dutta, Ashit Kumar, and Almotairi, Sultan
- Subjects
DATA transmission systems ,CLOUD storage ,TEXT files - Abstract
Cloud computing is an online data storage system that can be easily accessed anywhere. Various algorithms and techniques have been developed to secure cloud data, which, if used correctly, can detect cloud attacks. These algorithms can only detect cloud data attacks and cannot prevent such attacks. If an attacker gains access to the data, he or she can tamper with the data in any way that could lead to misuse of the data. This paper will design a secure architecture for securing data with various algorithm implementations on the architecture so that cloud data can be saved from replay attacks. First, a text file will be taken, the text file will be encrypted using the encryption mechanism, and this file will be transmitted on the SaaS cloud server platform. Whenever a file is uploaded to a cloud server, it will be broadcast across the network, after which any user can access it, whether it is valid or invalid. Whenever a file is downloaded from a cloud server, it will be necessary to decrypt it to access it. If the file is successfully decrypted, then the file will be verified. A verification mechanism will be used to verify the data, which will be used to check whether a replay attack has been made on the data or not. If the data authentication is successful, this data will be called authentic data. The novelty of this paper is that an algorithm has been developed in this paper to prevent replay attacks so that if the data is retransmitted with slight changes, then the authenticity and inauthenticity of the data will be identified. Recent papers will be compared with the proposed paper in the conclusion, and it will be pointed out how much better the current technique is than the previous one. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
33. Hamming codes for wet paper steganography.
- Author
-
Munuera, Carlos
- Subjects
HAMMING codes ,ERROR-correcting codes ,PERFECT codes ,CRYPTOGRAPHY ,SIGNS & symbols - Abstract
We study the application of Hamming codes to wet paper steganography. To that end, we propose the use of decoding algorithms that do not verify the minimum distance property and present one of these algorithms. We study its properties and show results of some numerical experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
34. DIGITAL CURRENCY: A CONCEPTUAL FRAMEWORK OF PERFORMANCE.
- Author
-
NGWAKWE, COLLINS C.
- Subjects
ELECTRONIC money ,INVESTORS ,PRICES ,MARKET capitalization ,CRYPTOCURRENCIES - Abstract
This paper explores and elucidates the concept of Cryptocurrency. It contributes a framework of digital money and also provides an analysis of the price range, which influences Cryptocurrency volume and market capitalisation. Findings from the OLS analysis show that the low price genre influences the volume and market capitalization of Cryptocurreny. Based on the results, the paper develops a price, volume and market capitalization framework for Cryptocurrency. The findings provide a practical and conceptual contribution for investors and future researchers on the concept of digital currency. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
35. Mixture Differential Cryptanalysis on Round-Reduced SIMON32/64 Using Machine Learning.
- Author
-
Wu, Zehan, Qiao, Kexin, Wang, Zhaoyang, Cheng, Junjie, and Zhu, Liehuang
- Subjects
BLOCK ciphers ,DEEP learning ,MACHINE learning ,TIME complexity ,CRYPTOGRAPHY ,ARTIFICIAL intelligence ,MIXTURES - Abstract
With the development of artificial intelligence (AI), deep learning is widely used in various industries. At CRYPTO 2019, researchers used deep learning to analyze the block cipher for the first time and constructed a differential neural network distinguisher to meet a certain accuracy. In this paper, a mixture differential neural network distinguisher using ResNet is proposed to further improve the accuracy by exploring the mixture differential properties. Experiments are conducted on SIMON32/64, and the accuracy of the 8-round mixture differential neural network distinguisher is improved from 74.7% to 92.3%, compared with that of the previous differential neural network distinguisher. The prediction accuracy of the differential neural network distinguisher is susceptible to the choice of the specified input differentials, whereas the mixture differential neural network distinguisher is less affected by the input difference and has greater robustness. Furthermore, by combining the probabilistic expansion of rounds and the neutral bit, the obtained mixture differential neural network distinguisher is extended to 11 rounds, which can realize the 12-round actual key recovery attack on SIMON32/64. With an appropriate increase in the time complexity and data complexity, the key recovery accuracy of the mixture differential neural network distinguisher can be improved to 55% as compared to 52% of the differential neural network distinguisher. The mixture differential neural network distinguisher proposed in this paper can also be applied to other lightweight block ciphers. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. Information Theory, Living Systems, and Communication Engineering.
- Author
-
Bajić, Dragana
- Subjects
INFORMATION theory ,DNA structure ,METHODS engineering ,DATA transmission systems ,SUSTAINABLE design - Abstract
Mainstream research on information theory within the field of living systems involves the application of analytical tools to understand a broad range of life processes. This paper is dedicated to an opposite problem: it explores the information theory and communication engineering methods that have counterparts in the data transmission process by way of DNA structures and neural fibers. Considering the requirements of modern multimedia, transmission methods chosen by nature may be different, suboptimal, or even far from optimal. However, nature is known for rational resource usage, so its methods have a significant advantage: they are proven to be sustainable. Perhaps understanding the engineering aspects of methods of nature can inspire a design of alternative green, stable, and low-cost transmission. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. Motion vector‐domain video steganalysis exploiting skipped macroblocks.
- Author
-
Li, Jun, Zhang, Minqing, Niu, Ke, Zhang, Yingnan, and Yang, Xiaoyuan
- Subjects
DISTRIBUTION (Probability theory) ,FEATURE extraction ,VIDEO processing ,CRYPTOGRAPHY - Abstract
Video steganography has the potential to be used to convey illegal information, and video steganalysis is a vital tool to detect the presence of this illicit act. Currently, all the motion vector (MV)‐based video steganalysis algorithms extract feature sets directly from the MVs, but ignoring the embedding operation may perturb the statistical distribution of other video encoding elements, such as the skipped macroblocks (no direct MVs). This paper proposes a novel 11‐dimensional feature set to detect MV‐based video steganography based on the above observation. The proposed feature is extracted based on the skipped macroblocks by recompression calibration. Specifically, the feature consists of two components. The first is the probability distribution of motion vector prediction (MVP) difference, and the second is the probability distribution of partition state transfer. Extensive experiments on different conditions demonstrate that the proposed feature set achieves good detection accuracy, especially in lower embedding capacities. In addition, the loss of detection performance caused by recompression calibration using mismatched quantization parameters (QP) is within the acceptable range, so the proposed method can be used in practical scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Secure encryption over the ring F2 + uF2 + vF2 + uvF2.
- Author
-
ŞOLT, Neriman, ÇALKAVUR, Selda, and GÜZELTEPE, Murat
- Subjects
CYCLIC codes ,PUBLIC key cryptography ,CRYPTOGRAPHY ,PROBLEM solving ,MATH anxiety ,LOCKS & keys - Abstract
Cryptology is a part of mathematics as encryption and decryption. The purpose of encryption is to make information incomprehensible when it is in the hands of unauthorized people. The receiver can decrypt the message that encrypted by the sender with helping of the key. The important point is that the key cannot be decrypted by other people. One Time Pad method solves this problem. The key is used only once each encryption in this method. So, the key becomes harder to guess. If the key is solved by unauthorized people, the message cannot be solved. Because of with each decryption, many meaningful messages are obtained. Every cyclic shift in a cyclic code constructs a new key and in each encryption is used the new key. Many keys are generated thanks to cyclic codes. In this paper, we improve the new encryption scheme by using the cyclic codes with One Time Pad method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. IoT Security for D-App in Supply Chain Management.
- Author
-
CERVINSKI, Teodor and TOMA, Cristian
- Subjects
SUPPLY chain management ,INTERNET of things ,MICROCONTROLLERS ,DATA transmission systems ,INDUSTRIAL costs - Abstract
The fast advance and evolution of technology in Internet of Things (IoT) is a double-edged sword, striking with new performant solutions and backfiring with a lot of unanswered questions. Due to cheap manufacturing costs and large-scale production, sensors, actuators and even microcontrollers are not designed with security on the first place. Also, the IoT market is a new one and that means that it is still unregulated and there isn’t a well-defined set of standards to control and manage better these problems. The IoT ascent has impacted many industries, but probably the most changes were made to the Supply Chain Management (SCM) industry. The forementioned question of cheap devices that need to be manufactured with a minimum of costs, very fast and ready to be deployed, is digging a big security hole in this kind of ecosystems. This paper aims to discuss the challenges involved in hardening de security in embedded devices, protecting the data and the communication channels between an IoT node and an IoT gateway and finally, assuring the persistence of data and its security after is stored. All these matters are addressed with privacy and security in design. Because SCM is a multiparty ecosystem that involves many different actors each with its tasks and data handling components, it is important to assure the fact that they will not interfere, tamper, or profit in a bad manner of each other. One solution for this problem is decentralization that comes with strings attached. Finally, and on short, this paper will try to describe a security model based on decentralization in a SCM flow, addressing its threats and how they can be overcome. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. Reversible Logic Gates and Applications - A Low Power Solution to VLSI Chips.
- Author
-
Tiwari, Kanchan S., Kadam, Rekha S., Dudhedia, Manisha A., Pansare, Jayshree R., Khedkar, Shilpa P., and Gawande, Shravan H.
- Subjects
LOGIC circuits ,GATE array circuits ,VERY large scale circuit integration ,DIGITAL electronics ,REVERSIBLE computing ,PROCESS capability - Abstract
In recent years, reversible logic gates have garnered significant interest because of their potential to decrease energy consumption and meet the growing need for low-power computing systems. Unlike conventional logic gates, reversible logic gates ensure that no information loss happens during computation, allowing for the reversal of the entire computation process. This unique characteristic opens up new avenues for developing energy-efficient digital circuits. This review paper serves as a vital contribution to the field by addressing a noticeable gap in the existing literature regarding reversible logic gates. The study not only comprehensively analyzes the array of reversible logic gates available but also underscores their practical applications and significance. It encompasses a wide variety of reversible logic gates, including Toffoli gates, Fredkin gates, and newer innovations. It is found that Toffoli gates outperformed in terms of gate count and quantum cost reduction, making them a preferred choice for quantum circuit optimization. Additionally, Fredkin gates showed exceptional performance in specific applications, like data swapping and quantum state control. The digital circuits like adders, multiplexers, ALU etc. are successfully designed using reversible gates like HNG, DKG etc. The significant gap this study fills lies in the need for a consolidated and in-depth analysis of the state-of-the-art reversible logic gates and their real-world utility. While prior research has discussed these gates individually, this paper takes a novel approach by offering a holistic assessment of their performance, quantum cost, gate count, and practical applications, thereby presenting a comprehensive resource for researchers, engineers, and designers in the field. This innovative contribution plays a pivotal role in shaping the progress of energy-efficient and quantum computing systems as well as in optimizing VLSI chip designs for various applications, with a particular emphasis on enhancing cryptographic and data processing capabilities. The findings of this review aim to stimulate further research and development in reversible computing, contributing to the advancement of energy-efficient and information-preserving computing systems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Cryptanalysis of Two Conditional Privacy Preserving Authentication Schemes for Vehicular Ad Hoc Networks.
- Author
-
Kabil, Ahmad Mohamad, Aslan, Heba, and Azer, Marianne
- Subjects
VEHICULAR ad hoc networks ,PUBLIC key cryptography ,CHINESE remainder theorem ,CRYPTOGRAPHY ,PRIVACY - Abstract
Conditional Privacy Preserving Authentication (CPPA) schemes are an effective way of securing communications in vehicular ad hoc networks (VANETs), as well as ensuring user privacy and accountability. Cryptanalysis plays a crucial role in pointing out the vulnerabilities in existing schemes to enable the development of more resilient ones. In 2019, Zhang proposed a CPPA scheme for VANET security (PA-CRT), based on identity batch verification (IBV) and Chinese Remainder Theorem (CRT). In this paper, we cryptanalyze Zhang's scheme and point out its vulnerability to impersonation and repudiation attacks. In 2023, Zhang's scheme was cryptanalyzed by Tao; however, we point out flaws in Tao's cryptanalysis due to invalid assumptions; hence, we propose countermeasures to Tao's attacks. Furthermore, in 2021, Xiong proposed a Certificateless Aggregate Signature (CLAS) scheme which is also cryptanalyzed in this paper. Finally, we analyze the causes and countermeasures by pointing out the vulnerabilities in each scheme that enabled us to launch successful attacks and proposing changes that would fortify these schemes against similar attacks in the future. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Possibility of land ownership transaction with non-fungible token technology: Minting survey plan.
- Author
-
Ilesanmi, Kolawole Samuel and Idowu, Timothy Oluwadare
- Subjects
LAND tenure ,NON-fungible tokens ,BLOCKCHAINS ,SURVEYS ,CRYPTOGRAPHY - Abstract
Context and background: The blockchain technology is as a new technology in vogue that is virtually getting a swift application in most important art world transactions. This is due to its public distributed, transparent, accountable, traceable and safe, ledger database, also is the advantage to secure a successful transaction without a third party. As the world keeps growing in the knowledge and the adoption of the technology, it is very important to practically explore the opportunities in this technology to combat the security and copyright problems facing land ownership transactions in the Cadastre system. Goal and Objectives: The goal of this paper is to practically access the possibility of engaging the blockchain technology in land administration and ownership systems while the objective is to convert legal instrument(s) into cryptographic readable data. Methodology: This was done by minting survey plans template into Non-Fungible Token. Two blockchains (Solana and CORE blockchains) were considered to show the possibility of adopting the technology in land administration and ownership systems. The selection was based on their flexibility, Scalability and the potentials to solve the trilemma blockchain problems. A survey plan template called DEMO (no real) was created for this purpose. Transactions on the FONE network Art NFT marketplace built on Solana blockchain was examined while an art NFT of survey plan template was minted on the Youngparrot NFT marketplace built on CORE blockchain. Results: The transactions were completed and the survey plan was successfully minted on the Core blockchain. the minting and transaction records are available and can be traced on the public blockchain ledger. Due to this advantage, this paper urges the consideration to take advantage of the possibilities and positivity of the technology in Land Administration sector and land ownership system and also provides steps to achieving its successful adoption. In addition, this is not a financial advice but a research work. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Ethics of Quantum Computing: an Outline.
- Author
-
Possati, Luca M.
- Abstract
This paper intends to contribute to the emerging literature on the ethical problems posed by quantum computing and quantum technologies in general. The key ethical questions are as follows: Does quantum computing pose new ethical problems, or are those raised by quantum computing just a different version of the same ethical problems raised by other technologies, such as nanotechnologies, nuclear plants, or cloud computing? In other words, what is new in quantum computing from an ethical point of view? The paper aims to answer these two questions by (a) developing an analysis of the existing literature on the ethical and social aspects of quantum computing and (b) identifying and analyzing the main ethical problems posed by quantum computing. The conclusion is that quantum computing poses completely new ethical issues that require new conceptual tools and methods. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
44. Assessing learning engagement based on facial expression recognition in MOOC’s scenario
- Author
-
Junge Shen, Zhiyong Cheng, Jiawei Li, and Haopeng Yang
- Subjects
Domain adaptation ,Computer Networks and Communications ,Emotional Changes ,business.industry ,Computer science ,Information technology ,Cryptography ,Online learning assessment ,Learning styles ,Computer graphics ,Learning engagement ,Facial expression recognition ,Hardware and Architecture ,Human–computer interaction ,Special Issue Paper ,Media Technology ,business ,Software ,CNN ,Information Systems - Abstract
Online learning has become one of the most important learning styles, yet with the need of supervisors to consistently keep the learners motivated and on-task. Some learners could be supervised by outer factors, and distance learners have to be motivated by themselves. However, online learning engagement is hardly to be assessed by supervisors in real time. With the rapid development of information technology, it is able to remedy the above problem by using intelligent video surveillance techniques. In this paper, we propose a novel framework of learning engagement assessment which introduces facial expression recognition to timely acquire the emotional changes of the learners. Moreover, a new facial expression recognition method is proposed based on domain adaptation, which is suitable for the MOOC scenario. The experiments show the effectiveness of our proposed framework on assessing learners’ learning engagement. The comparisons with the state-of-the-art methods also demonstrate the superiority of our proposed facial emotion recognition method.
- Published
- 2021
45. A CNN-based scheme for COVID-19 detection with emergency services provisions using an optimal path planning
- Author
-
Ahmed Barnawi, Neeraj Kumar, Mehrez Boulares, Prateek Chhikara, and Rajkumar Tekchandani
- Subjects
Scheme (programming language) ,Coronavirus disease 2019 (COVID-19) ,Computer Networks and Communications ,business.industry ,Computer science ,Real-time computing ,COVID-19 ,Cryptography ,Unmanned Aerial Vehicle ,Field (computer science) ,Transfer learning ,Computer graphics ,Hardware and Architecture ,Regular Paper ,Media Technology ,Computer vision ,Motion planning ,Architecture ,Transfer of learning ,business ,computer ,Path planning ,Software ,Information Systems ,computer.programming_language - Abstract
Unmanned Air Vehicles (UAVs) are becoming popular in real-world scenarios due to current advances in sensor technology and hardware platform development. The applications of UAVs in the medical field are broad and may be shared worldwide. With the recent outbreak of COVID-19, fast diagnostic testing has become one of the challenges due to the lack of test kits. UAVs can help in tackling the COVID-19 by delivering medication to the hospital on time. In this paper, to detect the number of COVID-19 cases in a hospital, we propose a deep convolution neural architecture using transfer learning, classifying the patient into three categories as COVID-19 (positive) and normal (negative), and pneumonia based on given X-ray images. The proposed deep-learning architecture is compared with state-of-the-art models. The results show that the proposed model provides an accuracy of 94.92%. Further to offer time-bounded services to COVID-19 patients, we have proposed a scheme for delivering emergency kits to the hospitals in need using an optimal path planning approach for UAVs in the network.
- Published
- 2021
46. Physical-Layer Security, Quantum Key Distribution, and Post-Quantum Cryptography.
- Author
-
Djordjevic, Ivan B.
- Subjects
QUANTUM cryptography ,CRYPTOGRAPHY ,FREE-space optical technology ,QUANTUM computers ,LINEAR network coding - Abstract
To solve for these problems, various schemes providing the perfect/unconditional security have been proposed, including physical-layer security (PLS), quantum key distribution (QKD), and post-quantum cryptography. Authors introduce the unambiguous state discrimination measurement and the photon-number-splitting attack against PM-QKD with imperfect phase randomization, demonstrating the rigorous security of decoy state PM-QKD with a discrete-phase randomization protocol. The topics addressed in this Special Issue include physical-layer security [[2]], quantum key distribution (QKD) [[2]], post-quantum cryptography [[6]], quantum-enhanced cryptography [[7]], stealth communication [[2]], and covert communication [[8]]. In the third article paper [[13]], authors introduce an open-destination MDI QKD network that provides security against untrusted relays and all detector side-channel attacks, in which all user users are capable of distributing keys with the help of other users. [Extracted from the article]
- Published
- 2022
- Full Text
- View/download PDF
47. Development of Security Rules and Mechanisms to Protect Data from Assaults.
- Author
-
Zahra, Syeda Wajiha, Arshad, Ali, Nadeem, Muhammad, Riaz, Saman, Dutta, Ashit Kumar, Alzaid, Zaid, Alabdan, Rana, Almutairi, Badr, and Almotairi, Sultan
- Subjects
BLOCK ciphers ,DATA security ,ATTEMPTED suicide ,CIPHERS ,CRYPTOGRAPHY ,SENSOR networks ,SECURITY management - Abstract
Cloud cryptography is the art of converting plain text into an unreadable format, which protects data and prevents the data from being misused by the attacker. Different researchers designed various Caesar cipher algorithms for data security. With the help of these algorithms, the data can be converted into a nonreadable format, but the data cannot be completely secured. In this paper, data security is provided in different phases. Firstly, data are secured through a bit-reversing mechanism in which those replace the actual values with no relation to the original data. Then the four-bit values are added at the beginning and end of bits using a salting mechanism to interlink the salting and existing bit-values and hide the original data. A Caesar cipher value is obtained by applying the Caesar cipher algorithm to the resulting bits. The Caesar cipher algorithm is used to implement number-of-shifting on the obtained values. An efficient cipher matrix algorithm is then developed in which different rules are designed to encrypt the data. Afterward, a secure cipher value is obtained by implementing Cipher XORation rules on the result obtained and the user-defined key. In the end, the proposed algorithm is compared with various papers. It identifies how much better the proposed algorithm performs than all the previous algorithms and how much the attack rate can be reduced if this algorithm is used for data security. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. A large-scale data security detection method based on continuous time graph embedding framework.
- Author
-
Liu, Zhaowei, Che, Weishuai, Wang, Shenqiang, Xu, Jindong, and Yin, Haoyu
- Subjects
DATA security ,MACHINE learning ,DATA privacy ,REPRESENTATIONS of graphs ,DATA security failures ,CRYPTOGRAPHY ,PUBLIC key cryptography - Abstract
Graph representation learning has made significant strides in various fields, including sociology and biology, in recent years. However, the majority of research has focused on static graphs, neglecting the temporality and continuity of edges in dynamic graphs. Furthermore, dynamic data are vulnerable to various security threats, such as data privacy breaches and confidentiality attacks. To tackle this issue, the present paper proposes a data security detection method based on a continuous-time graph embedding framework (CTDGE). The framework models temporal dependencies and embeds data using a graph representation learning method. A machine learning algorithm is then employed to classify and predict the embedded data to detect if it is secure or not. Experimental results show that this method performs well in data security detection, surpassing several dynamic graph embedding methods by 5% in terms of AUC metrics. Furthermore, the proposed framework outperforms other dynamic baseline methods in the node classification task of large-scale graphs containing 4321477 temporal information edges, resulting in a 10% improvement in the F1 score metric. The framework is also robust and scalable for application in various data security domains. This work is important for promoting the use of continuous-time graph embedding framework in the field of data security. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
49. A Multi-Party Functional Signatures Scheme for Private Blockchain.
- Author
-
Zhou, Quan, Zheng, Yulong, Wei, Kaijun, Chen, Minhui, and Zeng, Zhikang
- Subjects
BLOCKCHAINS ,DIGITAL signatures ,ARTIFICIAL intelligence ,ARTIFICIAL neural networks ,CRYPTOGRAPHY - Abstract
Digital signature technology is essential for ensuring the authenticity and unforgeability of transactions in a private blockchain framework. In some scenarios, transactions require verification from multiple parties, each of whom needs to authenticate different parts of the transaction. To address this issue, researchers have developed multi-party ECDSA (Elliptic Curve Digital Signature Algorithm) signature schemes. However, these schemes either need to consider the authentication of different parts of the transaction or generate an aggregated signature. This paper proposes a novel solution that combines functional signatures and multi-party ECDSA signatures to create a multi-party functional signature for private blockchains. Compared to previous constructions, the proposed scheme ensures that each part of the transaction is verified. Furthermore, when the aggregate signature of the entire transaction cannot be verified, this scheme identifies the specific part of the transaction for which the signature authentication fails instead of rejecting the entire transaction. This paper uses a smart contract to securely deploy the proposed scheme and authenticate the f in functional signatures. The constructed scheme also provides security under the existential unforgeability of the ECDSA signature, even if n − 1 parties are corrupted, assuming a total of n parties. The scheme of this paper successfully conducted experiments on a personal computer, with three users taking approximately 343 ms, six users taking 552 ms, and nine users taking 791 ms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
50. Enhancing Privacy in the Internet of Vehicles via Hyperelliptic Curve Cryptography.
- Author
-
Routis, George, Dagas, Panagiotis, and Roussaki, Ioanna
- Subjects
INTERNET privacy ,CRYPTOGRAPHY ,ELLIPTIC curve cryptography ,SMART cities ,INTERNET of things ,VEHICULAR ad hoc networks - Abstract
The Internet of Things (IoT) is a technological paradigm that has gained significant momentum the last decade and, among other features, enables the development of intelligent and interoperable device networks. In this respect, it has triggered the creation and evolution of vehicular ad-hoc networks (VANETs), which are initially implemented in order to guarantee the safety of drivers and the avoidance of traffic accidents. The drawback is that this fast evolution comes with serious concerns in terms of the privacy of users, while the population of attackers or entities that try to eavesdrop and intercept information has significantly increased. This imposes a serious risk for drivers moving across a Smart City. The research presented in this paper aims to evaluate privacy protection mechanisms in VANET environments, based on the efficiency and security level they ensure, considering the fact that VANETs provide limited resources to users/drivers. Moreover, the usage of elliptic curve cryptography in reduced resources environments is discussed. Finally, this paper compares the performance of three cryptographic algorithms, elliptic curve cryptography (ECC), hyperelliptic curve cryptography genus 2 (HECC-2) and HECC genus 3 (HECC-3), employed for an efficient authentication and safe message transmission mechanism in VANETs, aimed at reaching conclusions related to the implementation of each cryptographic scheme in this specific application area. The evaluation results indicate that ECC supersedes HECC-2 and HECC-3 in most metrics. However, HECC-2 and HECC-3 demonstrate better responses than ECC does in selected energy metrics. Overall, it is observed that HECC algorithms are not yet mature enough to compete with ECC. This is due to the fact that the research community has not sufficiently progressed toward the optimization of HECC, and moreover, HECC builds on quite complex mathematics. There are indications, however, that once HECC curves are indeed optimized, HECC will outperform ECC in speed as well as in other metrics, sinceHECC-2 and HECC-3 use a significantly smaller key size with the same level of security as that of ECC. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.