Related papers: Multivariate Cryptography with Mappings of Discret…
Let $f=(f_0,f_1,\dots, f_{\nu-1})$ be a collection of one-to-one functions from some space~$X$ into itself such that the sets $f_j(X)$ are disjoint. If $w=w_1w_2\cdots w_k$ is a word on the alphabet $\{0,1,\dots,\nu-1\}$, let $\Phi_{f,w} =…
Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many algorithms…
This article describes a lightweight additive homomorphic algorithm with the same encryption and decryption keys. Compared to standard additive homomorphic algorithms like Paillier, this algorithm reduces the computational cost of…
Digital signatures are the building blocks of modern communication to prevent masquerading by any party other than recipients, repudiation by signatory and forgery by any individual recipient. Digital signature scheme is said to be standard…
Multiphoton state in quantum cryptography decreases its security. Key disclosing with universal quantum cloning machine (UQCM) is considered in explicit manner. Although UQCM cannot make perfect clones, there is some invariant quantity…
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…
We present a classification of quantum public-key encryption protocols. There are six elements in quantum public-key encryption: plaintext, ciphertext, public-key, private-key, encryption algorithm and decryption algorithm. According to the…
With the development of machine learning, it is difficult for a single server to process all the data. So machine learning tasks need to be spread across multiple servers, turning the centralized machine learning into a distributed one.…
Signatures are primarily used as a mark of authenticity, to demonstrate that the sender of a message is who they claim to be. In the current digital age, signatures underpin trust in the vast majority of information that we exchange,…
In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…
We introduce explicit schemes based on the polarization phenomenon for the tasks of one-way secret key agreement from common randomness and private channel coding. For the former task, we show how to use common randomness and insecure…
Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully…
Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation. Focusing on secure communication, quantum cryptography has two major directions of development, namely…
Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes…
We obfuscate words of a given length in a free monoid on two generators with a simple factorization algorithm (namely $SL_2(\mathbb{N})$) to create a public-key encryption scheme. We provide a reference implementation in Python and…
In the classical setting, public-key encryption requires randomness in order to be secure against a forward search attack, whereby an adversary compares the encryption of a guess of the secret message with that of the actual secret message.…
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…
In this paper we have proposed a method that uses chaotic logistic mapping and DNA encoding to encrypt the image. A 32 bit ASCII private key is used to diffuse the image. The results demonstrated clearly show that encryption algorithm based…
Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be…
Quantum cryptography has been recently extended to continuous variable systems, e.g., the bosonic modes of the electromagnetic field. In particular, several cryptographic protocols have been proposed and experimentally implemented using…