We propose a new, unifying framework that yields an array of cryptographic primitives with certified deletion. These primitives enable a party in possession of a quantum ciphertext to generate a classical certificate that the encrypted plaintext has been information-theoretically deleted, and cannot be recovered even given unbounded computational resources. - For X \in {public-key, attribute-based, fully-homomorphic, witness, timed-release}, our compiler converts any (post-quantum) X encryption to X encryption with certified deletion. In addition, we compile statistically-binding commitments to statistically-binding commitments with certified everlasting hiding. As a corollary, we also obtain statistically-sound zero-knowledge proofs for QMA with certified everlasting zero-knowledge assuming statistically-binding commitments. - We also obtain a strong form of everlasting security for two-party and multi-party computation in the dishonest majority setting. While simultaneously achieving everlasting security against all parties in this setting is known to be impossible, we introduce everlasting security transfer (EST). This enables any one party (or a subset of parties) to dynamically and certifiably information-theoretically delete other participants' data after protocol execution. We construct general-purpose secure computation with EST assuming statistically-binding commitments, which can be based on one-way functions or pseudorandom quantum states. We obtain our results by developing a novel proof technique to argue that a bit b has been information-theoretically deleted from an adversary's view once they output a valid deletion certificate, despite having been previously information-theoretically determined by the ciphertext they held in their view. This technique may be of independent interest.
Blockchain technology, which includes cryptocurrencies such as Bitcoin, Ethereum,âŚetc [1,2] which has been evaluated as an investment tool by many people all over the world in recent years, needs to be examined in details, both mathematically and conceptually [8,9]. In fact, it can be said that blockchain technology, which is characterized as an accounting system and database based on distributed ledgers in its most basic form, is extremely secure in terms of copying data or attacking. For this reason, we can say that technology has a more effective security mechanism than any central state-of-the-art authoritative system used today. However, as it is almost impossible to bring all of the security, speed and cost parameters to their full extend in a system at the same time, as in any cryptosystem, the security parameter from the distributed ledger structure in blockchain technology adversely affects the speed and cost parameters. In this article, we discuss the cryptographic working principles of cryptocurrencies, which is an application field of blockchain technology, together with blockchain technology and the features and structures of the blocks contained.
Open access
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
Manal M. Khayyat, Mashael Khayyat, S. AbdelâKhalek, Romany F. Mansour
Industrial Internet of Things (IIoT) denotes a network of interlinked sensors, instruments, and other devices for industrial applications in the domains of manufacturing, logistics, transportation, etc. IIoT security is a major crucial research area for several applications. Image encryption techniques gained popularity in the recent years, thanks to increasing requirements for secure image transmission in IIoT environments. At the same time, conventional security solutions built for sensitive data protection are getting outdated in IIoT environment due to the participation of third party. Blockchain (BC) is one of the recent solutions used for security purpose which eliminates the involvement of a third party. With this motivation, the current research article presents a new BC-Enabled Shark Smell Optimization with Hopfield Chaotic Neural Network (SSO-HCNN) for secure encryption in IoT environment. The proposed SSO-HCNN model exploits a composite Chaotic Map (CM) which is integrated into staged logistic and tent maps to initially process the images and develop the variables needed for Arnold mapping. In addition, the SSO algorithm is developed with maximum PSNR and coefficient fitness function to select the optimum secret and public keys of the system amongst the random numbers. Besides, the diffusion phase utilizes HCNN to create a self-diffusion chaotic matrix whereas the jumbled image performs XOR operation using the keys to obtain the cipher image. In SSO-HCNN model, the cryptographic pixel value in the image is saved on BC thus guaranteeing the security and privacy of the images. To examine the superior performance of SSO-HCNN model over state-of-the-art methods, a set of simulations was conducted on benchmark test images. The simulation results of the proposed SSO-HCNN model were promising under different evaluation parameters.
Open access
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
This paper presents an overview of the basic concepts of cryptography and encryption. The work aims at presenting the main concepts and concerns of encryption on a high-level of abstraction, allowing non-domain expert readers to navigate through these topics. Less traditional arguments are also shown, from the relevance of Key Management Services with its usage in Envelope Encryption, to Zero Knowledge proofs and their innovative applications. The crucial importance of securing communications between IoT devices and widely used algorithms to do so, are also discussed.
Searchable symmetric encryption (SSE) provides an effective way to search encrypted data stored on untrusted servers. When the server is not trusted, it is indispensable to verify the results returned by it. However, the existing SSE schemes either lack fairness in the verification of search results, or do not support the verification of multiple keywords. To address this, we designed a multi-keyword verifiable searchable symmetric encryption scheme based on blockchain, which provides an efficient multi-keyword search and fair verification of search results. We utilized bitmap to build a search index in order to improve search efficiency, and used blockchain to ensure fair verification of search results. The bitmap and hash function are combined to realize lightweight multi-keyword search result verification, compared with the existing verification schemes using public key cryptography primitives, our scheme reduces the verification time and improves the verification efficiency. In addition, our scheme supports the dynamic update of files and realizes the forward security in update. Finally, formal security analysis proves that our scheme is secure against Chosen-Keyword Attacks (CKA), experimental analysis demonstrations that our scheme is efficient and viable in practice.
Tridip Bhowmik, Sagir Mahmud Sefat, Aysha Akmal, Md. Ismail Jabiullah
Cryptocurrency data communications are very demanding issues in current high-speed online currency transactions. Here, a key-based AES (Advanced Encryption Standard) encryption-decryption algorithm is used to impose more security levels on cryptocurrency data communications. For this, the sender first creates a key and sends it to the intended receiver through a secured and trusted channel. Then by that key one can easily encrypt the cryptocurrency data using the AES encryption algorithm and produced the ciphertext and then send it to the destination. On the receiverâs end, the decryption process of AES is performed by using the same shared secret key that retrieved the plaintext from the received ciphertext. The security of the proposed process depends on the shared secret key and the algorithm AES and it can be applied for any financial data transactions securely. This can be used in all kinds of cryptocurrency data communication with a higher level of security.
A secure electronic learning platform has been created to enable teachers and students to log into their accounts to learn efficiently and safely at any place and time. This platform has been proposed due to the urgent need to develop the education system and move it from traditional to interactive e-learning. In this paper, an application implemented that access remotely using a web browser interface and saved on a server depends on a Zero-Knowledge Proof (ZKP) system with an RSA algorithm was employed to solve registration and login challenges and securely transfer passwords. Using adapted AES to encrypt each user's personal information, Exams, and save it in in encrypted form in the database. The simulated results in this paper indicate the existence of a secure e-learning system, where security was achieved by performing the registration and login process without sending the password in its explicit form over an insecure network such as the Internet, in addition to encrypting the necessary information to be stored in an incomprehensible manner in the database, in the case of presence of an attack on the database.
Data security plays a major role in computer network. Because it helps to transmit data in secure way over the Internet. So we need to use strong security method for secure data transaction. Cryptography is a security tool which helps to transmit information from one place to another place over computer network. Cryptography follows encryption and decryption methods for data transmission. Cryptographic technique is completely based on key generation because it needs keys to transmit data between users. However cryptography works well in secure data transmission but it needs keys to provide security for data. In cryptography generation of keys taking more time than transmission of data. So in this paper we discuss about Zero-Knowledge Proof (ZKP) which is also based on cryptographic technique. ZKP is also useful in secure data transmission without sharing key values between users. This paper tells about overview of ZKP and how it is useful in data transmission.
Copyright protection in multimedia protection distribution is a challenging problem. To protect multimedia data, many watermarking methods have been proposed in the literature. However, most of them cannot be used effectively in a multimedia distribution network (MDN) as they are not designed to support multi-layer watermark embedding. Multi-layer watermarking mechanisms were developed to protect multimedia data across different layers in an MDN. However, in those mechanisms, we need to trust the entities in the MDN, such as regional and country distributors. To overcome this potential drawback, in this article, we propose a novel privacy protection mechanism for MDNs by combining the advantages of both blockchain and watermarking technologies. A specifically designed watermarking algorithm is used to link the copyright information with the audio file, while a novel blockchain-based smart contract mechanism is developed to enforce the proper functioning of each entity in the distribution network. Moreover, the new audio mechanism is computationally efficient. Although audio signals are used to show the effectiveness of the proposed mechanism, the proposed approach can easily be extended to other multimedia objects, such as an image. The validity of the proposed mechanism is demonstrated by our simulation results. The proposed mechanism can benefit multimedia production companies and other entities in the MDN.
Open access
Advanced Steganography and Watermarking Techniques
Sikha Pentyala, Davis Railsback, Ricardo Maia, Rafael Dowsley ¡ 7 authors
In the classical setting of differential privacy, a privacy-preserving query is performed on a private database, after which the query result is released to the analyst; a differentially private query ensures that the presence of a single database entry is protected from the analystâs view. In this work, we contribute the first definitional framework for differential privacy in the trusted curator setting (Fig. 1); clients submit private inputs to the trusted curator, which then computes individual outputs privately returned to each client. The adversary is more powerful than the standard setting; it can corrupt up to n-1 clients and subsequently decide inputs and learn outputs of corrupted parties. In this setting, the adversary also obtains leakage from the honest output that is correlated with a corrupted output. Standard differentially private mechanisms protect client inputs but do not mitigate output correlation leaking arbitrary client information, which can forfeit client privacy completely. We initiate the investigation of a novel notion of correlated-output differential privacy to bound the leakage from output correlation in the trusted curator setting. We define the satisfaction of both standard and correlated-output differential privacy as round differential privacy and highlight the relevance of this novel privacy notion to all application domains in the trusted curator model. \nWe explore round differential privacy in traditional "dark pool" market venues, which promise privacy-preserving trade execution to mitigate front-running; privately submitted trade orders and trade execution are kept private by the trusted venue operator. We observe that dark pools satisfy neither classic nor correlated-output differential privacy; in markets with low trade activity, the adversary may trivially observe recurring, honest trading patterns, and anticipate and front-run future trades. In response, we present the first round differentially private market mechanisms that formally mitigate information leakage from all trading activity of a user. This is achieved with fuzzy order matching, inspired by the standard randomized response mechanism; however, this also introduces a liquidity mismatch as buy and sell orders are not guaranteed to execute pairwise, thereby weakening output correlation; this mismatch is compensated for by a round differentially private liquidity provider mechanism, which freezes a noisy amount of assets from the liquidity provider for the duration of a privacy epoch, but leaves trader balances unaffected. We propose oblivious algorithms for realizing our proposed market mechanisms with secure multi-party computation (MPC) and implement these in the Scale-Mamba Framework using Shamir Secret Sharing based MPC. We demonstrate practical, round differentially private trading with comparable throughput as prior work implementing (traditional) dark pool algorithms in MPC; our experiments demonstrate practicality for both traditional finance and decentralized finance settings.
This paper uses CSSD developed by Two sets of cryptocurrencies were considered, one containing the 34 largest cryptocurrencies by market capitalisation and the other containing 15 cryptocurrencies with market capitalisations under $200 million. Any cryptocurrencies launched after 21/09/2018 were excluded from the samples in the interests of consistency. Using CSSD, no herding was detected while with CSAD a weak herding effect was observed, though the results were not statistically significant. This paper has important implications for cryptocurrency investors, researchers, and policymakers.
Abstract We proxy retail investor attention through Google Trends and find that fungible and non-fungible crypto tokens generate greater attention from high-gambling propensity regions. Crypto attention is higher during bubble-like episodes in the crypto market and for more lottery-like tokens. Moreover, retail crypto attention decreases after sports gambling is legalized. Higher token attention is associated with more contributors and higher fundraising. However, consumer credit default rates spike after periods of high crypto attention, but solely in the subprime segment. Overall, our findings suggest that gambling preferences strongly predict retail investor interest in the crypto market.
Bitcoin is one of many crypto currencies used for peer - to - peer transactions accessible to anyone with internet access. It is a decentralized digital currency not backed by any government or other legal entity, making it an attractive alternative to the traditional fiat money system. There is no doubt that crypto currencies are the future of money. However, not all crypto projects will succeed in the long run and some might even turn out to be scams. It?s a jungle out there! How do you know which crypt currency project is going to survive? Our paper can help you identify which projects have a good chance of survival by analyzing their market capitalization trends over time using equicorrelation analysis. This paper examines whether or not Bitcoin returns are dependent on common factors, investigates whether or not Bitcoin returns are i. i. d., tests the efficiency of crypt currency markets, and provides an answer to the following question: are crypto currencies efficient? We'll be looking at crypto currencies and their impact on financial markets. We'll also discuss the challenges of using crypto currencies as a predictor for later price movements and look at equicorrelation and its effect on the crypt currency market. We'll also discuss some of the challenges of using equicorrelation as a predictor for future price movements. Finally, we'll explore some potential applications for equicorrelation within the business world.
Mustafa TakaoÄlu, Adem ĂzyavaĹ, Naim Ajlouni, Ali Alshahrani ¡ 5 authors
Data security and data hiding have been studied throughout history. Studies show that steganography and encryption methods are used together to hide data and avoid detection. Large amounts of data hidden in the cover multimedia distort the image, which can be detected in visual and histogram analysis. The proposed method will solve two major drawbacks of the current methods: the limitation imposed on the size of the data to be hidden in the cover multimedia and low resistance to steganalysis after stego-operation. In the proposed method, plaintext data are divided into fixed-sized bits whose corresponding matching bitsâ indices in the cover multimedia are accumulated. Thus, the hidden data are composed of the indices in the cover multimedia, causing no change in it, thus enabling considerable amounts of plaintext to be hidden. The proposed method also has high resistance to known steganalysis methods because it does not cause any distortion to the cover multimedia. The test results show that the performance of the proposed method outperforms similar conventional stenographic techniques. The proposed OzyavasâTakaogluâAjlouni (OTA) method relieves the limitation on the size of the hidden data, and hidden data is undetectable by steganalysis because it is no longer embedded in the cover multimedia.
Open access
Advanced Steganography and Watermarking Techniques
As a result of the limited resources available in IoT local devices, the large scale cloud consumer's data that are produced by IoT related machines are contracted out to the cloud. Cloud computing is unreliable, using it can compromise user privacy, and data may be leaked. Because cloud-data and grid infrastructure are both growing exponentially, there is an urgent need to explore computational sources and cloud large-data protection. Numerous cloud service categories are assimilated into numerous fields, such as defense systems and pharmaceutical databases, to compute information space and allocation of resources. Attribute Based Encryption (ABE) is a sophisticated approach which can permit employees to specify a higher level of security for data stored in cloud storage facilities. Numerous obsolete ABE techniques are practical when applied to small data sets to generate cryptograms with restricted computational properties; their properties are used to generate the key, encrypt it, and decrypt it. To address the current concerns, a dynamic non-linear polynomial chaotic quantum hash technique on top of secure block chain model can be used for enhancing cloud data security while maintaining user privacy. In the proposed method, customer attributes are guaranteed by using a dynamic non- polynomial chaotic map function for the key initialization, encryption, and decryption. In the proposed model, both organized and unorganized massive clinical data are considered to be inputs for reliable corroboration and encoding. Compared to existing models, the real-time simulation results demonstrate that the stated standard is more precise than 90% in terms of bit change and more precise than 95% in terms of dynamic key generation, encipherment, and decipherment time.
Jilsa Chandarana, Rushit Ajudiya, Atharva Dattatreya, Rima Patel
In this fast-growing world, money has become a dominant asset. As the technology evolved, a new way of money transfer arose named Cryptocurrency. Cryptocurrency, also known as crypto, is a digital currency and has no physical form. Cryptocurrency is trending in finance and technical fields. It is very popular among investors as well. There is various cryptocurrency available in the market with different price and properties. The objective of this paper is to get familiar with cryptocurrency and compare different characteristics of top cryptocurrencies. The cryptocurrency listed in the paper were most likely to be found on any website about cryptocurrency. In this paper, an overview of all these cryptocurrencies is provided along with their prices. The list of top cryptocurrencies was taken from indiatoday.com and it was verified by other online sources.[1]
Abstract: Evolution and modernization have brought about progress in technology and this has led to the reduction in privacy & internet security due to an increase in cybercrime and threats. As a result of this turn of events, Cryptography is now being used as a means of keeping information of any kind safe from third party individual(s). Research has shown that with the Encryption of information, third party individual(s) have no chance or less chance of getting past this security measure. Hence, Cryptographers keep improving algorithms to make it impossible for a third party to decrypt this information without the key which is where database Privacy and Security come in. The database contains all the information which is a major asset, there are encryptions which can be used at different levels to provide security. Lastly, for encryption algorithms which are breached by unknown third-party individual(s), the zero knowledge of proof helps to figure out the identity of this individual. They are an extremely interesting and useful construct. They are fascinating because of their definition, which is mutually opposed, their applicability is very vast in cryptography; they are used to restrict the malevolent users to work according to the protocol. Zero-knowledge serve as a good medium to understand the problems regarding cryptographic protocols. Keywords: Cipher, Encryption, Decryption, Key, Security, Database, Zero-Knowledge
Diego F. Aranha, Sebastian Berndt, Thomas Eisenbarth, Okan Seker ¡ 7 authors
We study masking countermeasures for side-channel attacks against signature schemes constructed from the MPC-in-the-head paradigm, specifically when the MPC protocol uses preprocessing. This class of signature schemes includes Picnic, an alternate candidate in the third round of the NIST post-quantum standardization project. The only previously known approach to masking MPC-in-the-head signatures suffers from interoperability issues and increased signature sizes. Further, we present a new attack to demonstrate that known countermeasures are not sufficient when the MPC protocol uses a preprocessing phase, as in Picnic3.We overcome these challenges by showing how to mask the underlying zero-knowledge proof system due to KatzâKolesnikovâWang (CCS 2018) for any masking order, and by formally proving that our approach meets the standard security notions of non-interference for masking countermeasures. As a case study, we apply our masking technique to Picnic. We then implement different masked versions of Picnic signing providing first order protection for the ARM Cortex M4 platform, and quantify the overhead of these different masking approaches. We carefully analyze the side-channel risk of hashing operations, and give optimizations that reduce the CPU cost of protecting hashing in Picnic by a factor of five. The performance penalties of the masking countermeasures ranged from 1.8 to 5.5, depending on the degree of masking applied to hash function invocations.
Open access
Cryptographic Implementations and Security
Chaos-based Image/Signal Encryption
Physical Unclonable Functions (PUFs) and Hardware Security
Nonogram is a pencil puzzle consisting of a rectangular white grid where the player has to paint some cells black according to given constraints. In 2010, Chien and Hon constructed a physical card-based zero-knowledge proof protocol for Nonogram, which enables a prover to physically show that he/she knows a solution of the puzzle without revealing it. However, their protocol requires special tools such as scratch-off cards and a sealing machine, making it impractical to implement in real world. The protocol also has a nonzero soundness error. In this paper, we develop a more practical card-based protocol for Nonogram with perfect soundness that uses only regular paper cards. We also show how to modify our protocol to make it support Nonogram Color, a generalization of Nonogram where the player has to paint the cells with multiple colors.
Medical images carry a lot of important information for making a medical diagnosis. Since the medical images need to be communicated frequently to allow timely and accurate diagnosis, it has become a target for malicious attacks. Hence, medical images are protected through encryption algorithms. Recently, reversible data hiding on the encrypted images (RDHEI) schemes are employed to embed private information into the medical images. This allows effective and secure communication, wherein the privately embedded information (e.g., medical records and personal information) is very useful to the medical diagnosis. However, existing RDHEI schemes still suffer from low embedding capacity, which limits their applicability. Besides, such solution still lacks a good mechanism to ensure its integrity and traceability. To resolve these issues, a novel approach based on image block-wise encryption and histogram shifting is proposed to provide more embedding capacity in the encrypted images. The embedding rate is over 0.8 bpp for typical medical images. On top of that, a blockchain-based system for RDHEI is proposed to resolve the traceability. The private information is stored on the blockchain together with the hash value of the original medical image. This allows traceability of all the medical images communicated over the proposed blockchain network.
Open access
Advanced Steganography and Watermarking Techniques