3,401 research outputs found
Security of signed ELGamal encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against the adaptive chosen ciphertext attack, in which an attacker can freely use a decryption oracle except for the target ciphertext. We also prove security against the novel one-more-decyption attack. Our security proofs are in a new model, corresponding to a combination of two previously introduced models, the Random Oracle model and the Generic model. The security extends to the distributed threshold version of the scheme. Moreover, we propose a very practical scheme for private information retrieval that is based on blind decryption of ElGamal ciphertexts
Quantum Conference
A notion of quantum conference is introduced in analogy with the usual notion
of a conference that happens frequently in today's world. Quantum conference is
defined as a multiparty secure communication task that allows each party to
communicate their messages simultaneously to all other parties in a secure
manner using quantum resources. Two efficient and secure protocols for quantum
conference have been proposed. The security and efficiency of the proposed
protocols have been analyzed critically. It is shown that the proposed
protocols can be realized using a large number of entangled states and group of
operators. Further, it is shown that the proposed schemes can be easily reduced
to protocol for multiparty quantum key distribution and some earlier proposed
schemes of quantum conference, where the notion of quantum conference was
different.Comment: 12 pages, 1 figur
Experimental quantum key distribution with finite-key security analysis for noisy channels
In quantum key distribution implementations, each session is typically chosen
long enough so that the secret key rate approaches its asymptotic limit.
However, this choice may be constrained by the physical scenario, as in the
perspective use with satellites, where the passage of one terminal over the
other is restricted to a few minutes. Here we demonstrate experimentally the
extraction of secure keys leveraging an optimal design of the
prepare-and-measure scheme, according to recent finite-key theoretical
tight-bounds. The experiment is performed in different channel conditions, and
assuming two distinct attack models: individual attacks, or general quantum
attacks. The request on the number of exchanged qubits is then obtained as a
function of the key size and of the ambient quantum bit error rate. The results
indicate that viable conditions for effective symmetric, and even one-time-pad,
cryptography are achievable.Comment: 20 pages, 4 figure
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes
We present here a new family of trapdoor one-way Preimage Sampleable
Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is
one-way under two computational assumptions: the hardness of generic decoding
for high weights and the indistinguishability of generalized -codes.
Our proof follows the GPV strategy [GPV08]. By including rejection sampling, we
ensure the proper distribution for the trapdoor inverse output. The domain
sampling property of our family is ensured by using and proving a variant of
the left-over hash lemma. We instantiate the new Wave-PSF family with ternary
generalized -codes to design a "hash-and-sign" signature scheme which
achieves existential unforgeability under adaptive chosen message attacks
(EUF-CMA) in the random oracle model. For 128 bits of classical security,
signature sizes are in the order of 15 thousand bits, the public key size in
the order of 4 megabytes, and the rejection rate is limited to one rejection
every 10 to 12 signatures.Comment: arXiv admin note: text overlap with arXiv:1706.0806
Semi-quantum communication: Protocols for key agreement, controlled secure direct communication and dialogue
Semi-quantum protocols that allow some of the users to remain classical are
proposed for a large class of problems associated with secure communication and
secure multiparty computation. Specifically, first time semi-quantum protocols
are proposed for key agreement, controlled deterministic secure communication
and dialogue, and it is shown that the semi-quantum protocols for controlled
deterministic secure communication and dialogue can be reduced to semi-quantum
protocols for e-commerce and private comparison (socialist millionaire
problem), respectively. Complementing with the earlier proposed semi-quantum
schemes for key distribution, secret sharing and deterministic secure
communication, set of schemes proposed here and subsequent discussions have
established that almost every secure communication and computation tasks that
can be performed using fully quantum protocols can also be performed in
semi-quantum manner. Further, it addresses a fundamental question in context of
a large number problems- how much quantumness is (how many quantum parties are)
required to perform a specific secure communication task? Some of the proposed
schemes are completely orthogonal-state-based, and thus, fundamentally
different from the existing semi-quantum schemes that are
conjugate-coding-based. Security, efficiency and applicability of the proposed
schemes have been discussed with appropriate importance.Comment: 19 pages 1 figur
Tight Finite-Key Analysis for Quantum Cryptography
Despite enormous progress both in theoretical and experimental quantum
cryptography, the security of most current implementations of quantum key
distribution is still not established rigorously. One of the main problems is
that the security of the final key is highly dependent on the number, M, of
signals exchanged between the legitimate parties. While, in any practical
implementation, M is limited by the available resources, existing security
proofs are often only valid asymptotically for unrealistically large values of
M. Here, we demonstrate that this gap between theory and practice can be
overcome using a recently developed proof technique based on the uncertainty
relation for smooth entropies. Specifically, we consider a family of
Bennett-Brassard 1984 quantum key distribution protocols and show that security
against general attacks can be guaranteed already for moderate values of M.Comment: 11 pages, 2 figure
- …