相关论文: Hidden Polynomial(s) Cryptosystems

Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to exchange sensitive information on the Internet. Trust…

A peer-to-peer network, enabling different parties to jointly store and run computations on data while keeping the data completely private. Enigma's computational model is based on a highly optimized version of secure multi-party…

This paper provides a simple variation of the basic ideas of the BB84 quantum cryptographic scheme leading to a method of key expansion. A secure random sequence (the bases sequence) determines the encoding bases in a proposed scheme. Using…

The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes. In particular, a deterministic scheme using quartic reciprocity is described that works…

MinRank is an NP-complete problem in linear algebra whose characteristics make it attractive to build post-quantum cryptographic primitives. Several MinRank-based digital signature schemes have been proposed. In particular, two of them,…

This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation-equivalent to the secret code. This increases the security level of the public key, thus opening the way…

This paper describes BlockPKI, a blockchain-based public-key infrastructure that enables an automated, resilient, and transparent issuance of digital certificates. Our goal is to address several shortcomings of the current TLS…

A continuous key distribution scheme is proposed that relies on a pair of canonically conjugate quantum variables. It allows two remote parties to share a secret Gaussian key by encoding it into one of the two quadrature components of a…

In privacy-preserving machine learning, individual parties are reluctant to share their sensitive training data due to privacy concerns. Even the trained model parameters or prediction can pose serious privacy leakage. To address these…

In this Letter, we present quantum secret sharing and secret splitting protocols with single photons running forth and back between the participating parties. The protocol has a high intrinsic efficiency, namely all photons except those…

In this paper, we present a variant of Waters' Identity-Based Encryption scheme with a much smaller public-key size (only a few kilobytes). We show that this variant is semantically secure against passive adversaries in the standard…

We describe a cryptographic protocol in which Wheeler's delayed choice experiment is used to generate the key distribution. The protocol, which uses photons polarized only along one axis, is secure against general attacks.

A directly public verifiable signcryption scheme is introduced in this paper that provides the security attributes of message confidentiality, authentication, integrity, non-repudiation, unforgeability, and forward secrecy of message…

A new quantum cryptography protocol, based on all unselected states of a qubit as a sort of alphabet with continuous set of letters, is proposed. Its effectiveness is calculated and shown to be essentially higher than those of the other…

We proposed a new quantum bit commitment scheme in which secret key need not to be provided by other quantum key distribution system. We can get the bit commitment with probability p by adding a waiting time in a frame during operating the…

In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time…

Here is a more detailed description of the algorithm proposed in [1]. This algorithm simultaneously uses two cryptographic procedures: encryption using a generalization of the Markovski algorithm [2] and encryption using a system of…

We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear…

We propose a protocol based on mechanism design theory and encrypted control to solve average consensus problems among rational and strategic agents while preserving their privacy. The proposed protocol provides a mechanism that…

Most cryptosystems are defined over finite algebraic structures where arithmetic operations are performed modulo natural numbers. This applies to private key as well as to public key ciphers. No secure cryptosystems defined over the field…