English
Related papers

Related papers: The key exchange cryptosystem used with higher ord…

200 papers

Cryptography protects users by providing functionality for the encryption of data and authentication of other users. This technology lets the receiver of an electronic message verify the sender, ensures that a message can be read only by…

Cryptography and Security · Computer Science 2011-10-10 Penmetsa V. Krishna Raja , A. S. N. Chakravarthy , P. S. Avadhani

We prove that it is impossible to construct perfect-complete quantum public-key encryption (QPKE) with classical keys from quantumly secure one-way functions (OWFs) in a black-box manner, resolving a long-standing open question in quantum…

Quantum Physics · Physics 2025-04-09 Longcheng Li , Qian Li , Xingjian Li , Qipeng Liu

We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we…

Quantum Physics · Physics 2013-02-28 Li Yang , Chong Xiang , Bao Li

Covert communication allows us to transmit messages in such a way that it is not possible to detect that the communication is occurring. This provides protection in situations where knowledge that people are talking to each other may be…

Quantum Physics · Physics 2018-02-28 Juan Miguel Arrazola , Ryan Amiri

We present a three-stage quantum cryptographic protocol guaranteeing security in which each party uses its own secret key. Unlike the BB84 protocol, where the qubits are transmitted in only one direction and classical information exchanged…

Quantum Physics · Physics 2012-08-07 Subhash Kak

A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more…

The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems…

Quantum Physics · Physics 2018-10-31 Yingkai Ouyang , Si-Hui Tan , Joseph Fitzsimons

We consider the secure communication problem for broadcasting of two encrypted sources. The sender wishes to broadcast two secret messages via two common key cryptosystems. We assume that the adversary can use the side-channel, where the…

Information Theory · Computer Science 2019-06-26 Bagus Santoso , Yasutada Oohama

The ability to hide information from unauthorized individuals has been a prevalent issue over the years. Countless algorithms such as DES, AES and SHA have been developed. These algorithms depend on varying key length and key management…

Cryptography and Security · Computer Science 2012-09-14 Samuel King Opoku

Recently, a quantum key exchange protocol has been described, which served as basis for securing an actual bank transaction by means of quantum cryptography [quant-ph/0404115]. Here we show, that the authentication scheme applied is…

Quantum Physics · Physics 2007-05-23 Thomas Beth , Joern Mueller-Quade , Rainer Steinwandt

We perform a comparison of two protocols for generating a cryptographic key composed from d-valued symbols: one exploiting a string of independent qubits and another one utilizing d-level systems prepared in states belonging to d+1 mutually…

Quantum Physics · Physics 2015-06-26 D. B. Horoshko , S. Ya. Kilin

Here is described a preliminary method that enables secure 'anti-search-engine' encryption, where the middleman can participate in the encrypted information exchange, without being able to understand the exchanged information, encrypted…

Cryptography and Security · Computer Science 2010-01-13 Antti Alexander Kestila

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…

Cryptography and Security · Computer Science 2024-09-13 Robert Hines

Recently, we have shown the advantages of two-way quantum communications in continuous variable quantum cryptography. Thanks to this new approach, two honest users can achieve a non-trivial security enhancement as long as the Gaussian…

Quantum Physics · Physics 2008-09-18 Stefano Pirandola , Stefano Mancini , Seth Lloyd , Samuel L. Braunstein

This paper gives the definition and property of a bit-pair shadow, and devises the three algorithms of a public key cryptoscheme called JUOAN that is based on a multivariate permutation problem and an anomalous subset product problem to…

Cryptography and Security · Computer Science 2017-05-02 Shenghui Su , Shuwang Lu , Maozhi Xu , Tao Xie

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

We show that private shared reference frames can be used to perform private quantum and private classical communication over a public quantum channel. Such frames constitute a novel type of private shared correlation (distinct from private…

Quantum Physics · Physics 2007-05-23 Stephen D. Bartlett , Terry Rudolph , Robert W. Spekkens

A secret key can be used to conceal information from an eavesdropper during communication, as in Shannon's cipher system. Most theoretical guarantees of secrecy require the secret key space to grow exponentially with the length of…

Information Theory · Computer Science 2012-05-18 Curt Schieler , Paul Cuff

The paper deals with time-scaling transformations of dynamical systems. Such scaling functions operate a change of coordinates on the time axis of the system trajectories preserving its phase portrait. Exploiting this property, a chaos…

Chaotic Dynamics · Physics 2015-05-13 Donatello Materassi , Michele Basso

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka
‹ Prev 1 8 9 10 Next ›