Related papers: The Peacock Encryption Method
The methods of quantum cryptography enable one to have perfectly secure communication lines, whereby the laws of quantum physics protect the privacy of the data exchanged. Each quantum-cryptography scheme has its own security criteria that…
Quantum cryptography is reviewed, first using entanglement both for the intuition and for the experimental realizations. Next, the implementation is simplified in several steps until it becomes practical. At this point entanglement has…
This note describes some cryptographic issues related to multi-located parties. In general, multi-located parties make it difficult for the eavesdropper to mount the man-in-the-middle attack. Conversely, they make it easier to address…
Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes…
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are…
Companies and individuals demand more and more storage space and computing power. For this purpose, several new technologies have been designed and implemented, such as the cloud computing. This technology provides its users with storage…
We present a distributed average consensus protocol that preserves the privacy of agents' inputs. Unlike the differential privacy mechanisms, the presented protocol does not affect the accuracy of the output. It is shown that the protocol…
We consider an Internet of Battlefield Things (IoBT) system consisting of multiple devices that want to securely communicate with each other during a mission in the presence of an adversary with unbounded computational power. The adversary…
Using the computational resources of an untrusted third party to crack a password hash can pose a high number of privacy and security risks. The act of revealing the hash digest could in itself negatively impact both the data subject who…
How to detect and mitigate deceptive AI systems is an open problem for the field of safe and trustworthy AI. We analyse two algorithms for mitigating deception: The first is based on the path-specific objectives framework where paths in the…
Recently, Abdalla et al. proposed a new gateway-oriented password-based authenticated key exchange (GPAKE) protocol among a client, a gateway, and an authentication server, where each client shares a human-memorable password with a trusted…
Secure messaging applications often offer privacy to users by protecting their messages from would be observers through end-to-end encryption techniques. However, the metadata of who communicates with whom cannot be concealed by encryption…
Scientific collaborations benefit from collaborative learning of distributed sources, but remain difficult to achieve when data are sensitive. In recent years, privacy preserving techniques have been widely studied to analyze distributed…
End-to-end encrypted (E2EE) messaging is an essential first step in providing message confidentiality. Unfortunately, all security guarantees of end-to-end encryption are lost when keys or plaintext are disclosed, either due to device…
This paper re-examines the security of three related block cipher modes of operation designed to provide authenticated encryption. These modes, known as PES-PCBC, IOBC and EPBC, were all proposed in the mid-1990s. However, analyses of…
We analyze the fundamental trade-off of secret key-based authentication systems in the presence of an eavesdropper for correlated Gaussian sources. A complete characterization of trade-off among secret-key, storage, and privacy-leakage…
A privacy-preserving English auction protocol with round efficiency based on a modified ring signature has been proposed in this paper. The proposed protocol has three appealing characteristic: First, it offers conditional…
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use…
In the bounded retrieval model, the adversary can leak a certain amount of information from the message sender's computer (e.g., 10 percent of the hard drive). Bellare, Kane and Rogaway give an efficient symmetric encryption scheme in the…
A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the…