arXiv:1301.0313

The Piggy Bank Cryptographic Trope

Subhash C. Kak

Published Jan 1, 2013• 22 citations

Abstract

This paper presents applications of the trope of the locked and sealed piggy-bank into which the secret can be easily inserted but from which it cannot be withdrawn without opening the box. We present a basic two-pass cryptographic scheme that can serve as template for a variety of implementations. Together with the sealed piggy-bank is sent a coded letter that lists and certifies the contents of the box. We show how this idea can help increase the security of cryptographic protocols for classical systems as well as those based on "single-state" systems. More specifically, we propose the use of a hashing digest (instead of the coded letter) to detect loss of key bits to the eavesdropper and use in communication systems where error correction is an important issue.

DOI: 10.48550/arxiv.1301.0313

Related papers

Secret Sharing With Trusted Third Parties Using Piggy Bank Protocol

Adnan Memon

This paper presents a new scheme to distribute secret shares using two trusted third parties to increase security and eliminate the dependency on single trusted third party. This protocol for communication between a device and two trusted third parties uses the piggy bank cryptographic paradigm. We also present a protocol to give law enforcing agencies access to sensitive information present on a cell phone or a device using secret sharing scheme. The ideas for classical systems may also be applied to quantum schemes.

arXiv:1608.05097Aug 17, 20160 citations

A Piggybank Protocol for Quantum Cryptography

Navya Chodisetti

This paper presents a quantum mechanical version of the piggy-bank cryptography protocol. The basic piggybank cryptography idea is to use two communications: one with the encrypted message, and the other regarding the encryption transformation which the receiver must decipher first. In the quantum mechanical version of the protocol, the encrypting unitary transformation information is sent separately but just deciphering it is not enough to break the system. The proposed quantum protocol consists of two stages.

arXiv:1406.2285Jun 9, 20141 citation

Sealing quantum message by quantum code

H. F. Chau

Quantum error correcting code is a useful tool to combat noise in quantum computation. It is also an important ingredient in a number of unconditionally secure quantum key distribution schemes. Here, I am going to show that quantum code can also be used to seal a quantum message. Specifically, every one can still read the content of the sealed quantum message. But, any such attempt can be detected by an authorized verifier with an exponentially close to one probability

arXiv:quant-ph/0308146Aug 27, 20034 citations

Design of a Quantum Resistant Cryptography Algorithm for Blockchain Network Using Modified Bit Flipping Key Encapsulation

Fagbohunmi Griffin Siji

Due to the continuous development of Quantum computing, it is envisaged that in the near future, classical cryptography will no longer be considered secure, these will make systems which rely on them become outdated. One of such system is the Blockchain networks used in diverse applications, such as cryptocurrency, banks, supply chain management , just to mention but a fe .Current algorithms used to secure Blockchain networks such as Rivest-Shamir Adieman (RSA), Secure Hash Algorithm, 256 bit (SHA 256) and Elliptic Curve Cryptography (ECC) are prone to quantum attacks.. They all employ the traditional cryptography techniques which are prone to attack by Quantum computing algorithms It has been shown that Shor’s and Grover’s algorithm can easily compromise asymmetric encryption by increasing the rate at which brute force attack can be implemented. As a result of these development it becomes imperative to design an efficient quantum resistant blockchain algorithm capable of protecting decentralised systems like banks and corporate organizations from Quantum computing threats. The aim of this paper is to design a novel Quantum resistant cryptography algorithm (QRCA) that can protect systems from Quantum computing attacks. The algorithm consist of code-based Modified Bit Flipping key exchange (MBIKE) and Post-Quantum Pseudorandom Number Generators (PQ-PRNGs) to create Quantum resistant blockchain encrypting protocol. The traditional classical encrypting techniques is now replaced with a new code based cryptography protocol, MBIKE is a key Encapsulation Mechanism (KEM) which is usually regarded as a post quantum key distribution protocol and it can therefore be a good replacement for Quantum Key distribution (QKD). MBIKE is able to protect blockchain networks from eavesdropping, while PQ-PRNG provides randomness in cryptography key distribution, which aids in making the cryptographic keys difficult to compute by hackers. The code-based key generation helps to build a secure error detecting and correcting codes. The protocol designed in the paper improves the accuracy of encryption, secure key exchange and immunity to quantum hacking with only a little overhead. The operation of the protocol enhances network transparency as well protect the blockchain network from yet to be identified quantum threats. Experimental analysis show that the protocol guarantees 99.5% protection of blockchain networks against quantum attacks, thereby enhancing the economy of large decentralized networks used in multinational corporations.

Advances in NetworksJun 5, 20260 citations

On secure communications without eavesdropper channel state

Phillip A. Regalia

The ubiquity of wireless connectivity between an ever-increasing number of devices has confirmed dire past predictions of widespread eavesdropping (among other security concerns) in wireless networks, further promoting the need for secure communications. Of particular interest are physical layer techniques which exploit error-correction coding intrinsic to digital transceivers and which offer two clear advantages: (i) no need for key distribution; and (ii) secrecy that is not conditioned on a computationally limited adversary. Present techniques, however, assume some knowledge of the channel connecting the transmitter to the eavesdropper; if the eavesdropper is truly passive, this critical parameter is unavailable. We therefore examine secure communication schemes that do not assume knowledge of the eavesdropper's channel, yet remain keyless in their operation. Two schemes are offered, with behavior intermediate between cryptographic and information-theoretic solutions.

IEEE International Symposium on Circuits and Systems proceedingsMay 1, 20172 citations

Key Distribution in PKC through Quantas

Aditya Goel

Cryptography literally means “The art & science of secret writing & sending a message between two parties in such a way that its contents cannot be understood by someone other than the intended recipient. ” and Quantum word is related with “Light”. Thus, Quantum Cryptography is a way of descripting any information in the form of quantum particles. There are no classical cryptographic systems which are perfectly secure. In contrast to Classical cryptography which depends upon Mathematics, Quantum Cryptography utilizes the concepts of Quantum Physics which provides us the security against the cleverest marauders of the present age. In the view of increasing need of Network and Information Security, we do require methods to overcome the Molecular Computing technologies (A future technology) and other techniques of the various codebrakers. Both the parts i.e. Quantum Key distribution and Information transference from Sender to Receiver are much efficient and secure. It is based upon BB84 protocol. It can be of great use for Govt. agencies such as Banks, Insurance, Brokerages firms, financial institutions, e-commerce and most important is the Defense & security of any country. It is a Cryptographic communication system in which the original users can detect unauthorized eavesdropper and in addition it gives a guarantee of no eavesdropping. It proves to be the ultra secure mode of communication b/w two intended parties.

Sep 4, 20160 citations