搜索结果: 136-150 共查到“applications”相关记录2272条 . 查询时间(0.216 秒)
Short Lattice-based One-out-of-Many Proofs and Applications to Ring Signatures
lattice-based cryptography zero-knowledge proof ring signature
2018/8/28
In this work, we construct a short one-out-of-many proof from (Module-SIS) lattices, allowing one to prove knowledge of a secret associated with one of the public values in a set. The proof system fol...
Thring Signatures and their Applications to Spender-Ambiguous Digital Currencies
ring signatures confidential transactions spender ambiguity
2018/8/28
We present threshold ring multi-signatures (thring signatures) for collaborative computation of ring signatures, discuss a game of existential forgery for thring signatures, and discuss the uses of th...
Towards Static Assumption Based Cryptosystem in Pairing Setting: Further Applications of DéjàQ and Dual-Form Signature
Bilinear target assumption q-type assumption DejaQ technique and Dual form signature technique
2018/8/16
A large number of parameterized complexity assumptions have been introduced in the bilinear pairing setting to design novel cryptosystems and an important question is whether such ``qq-type" assumptio...
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
Homomorphic secret sharing share conversion fully homomorphic encryption
2018/8/10
The distributed discrete logarithm (DDL) problem was introduced by Boyle et al. at CRYPTO 2016. A protocol solving this problem was the main tool used in the share conversion procedure of their homomo...
Threshold Partially-Oblivious PRFs with Applications to Key Management
Oblivious PRF Key Management
2018/8/10
An Oblivious PRF (OPRF) is a protocol between a server holding a key to a PRF and a user holding an input. At the end of the interaction, the user learns the output of the OPRF on its input and nothin...
Reproducible Codes and Cryptographic Applications
code-based cryptography structured codes
2018/7/16
In this paper we study structured linear block codes, starting from well known examples and generalizing them to a wide class of codes that we call reproducible codes. These codes have the property th...
Cryptographic primitives from coding theory are some of the most promising candidates for NIST's Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques ...
New techniques for multi-value homomorphic evaluation and applications
lwe-based FHE multi-value bootstrapping homomorphic LUT
2018/6/25
In this paper, we propose a new technique to perform several homomorphic operations in one bootstrapping call over a multi-value plaintext space. Our construction relies on the FHEW-based gate bootstr...
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
non-malleable codes continuous non-malleable codes non-malleable commitments
2018/6/19
Non-Malleable Codes (NMC) were introduced by Dziembowski, Pietrzak and Wichs in ICS 2010 as a relaxation of error correcting codes and error detecting codes. Faust, Mukherjee, Nielsen, and Venturi in ...
The Twin Conjugacy Search Problem and Applications
The twin conjugacy search problem trapdoor test CCA
2018/6/13
We propose a new computational problem over the noncommutative group, called the twin conjugacy search problem. This problem is related to the conjugacy search problem and can be used for almost all o...
Finding Small Solutions of the Equation $Bx-Ay=z$ and Its Applications to Cryptanalysis of the RSA Cryptosystem
RSA Cryptanalysis Lattice
2018/6/6
We present two attacks on RSA as its applications. One focuses on the case with known bits of the private exponent together with the prime factor, and the other considers the case with a small differe...
On the Hardness of the Computational Ring-LWR Problem and its Applications
Lattice Techniques Public Key Cryptography
2018/6/5
In this paper, we propose a new assumption, the Computational Learning With Rounding over rings, which is inspired by the computational Diffie-Hellman problem. Assuming the hardness of ring-LWE, we pr...
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
zero-knowledge proofs signatures
2018/5/28
Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoKs) for arbitrary Boolean circuits based on symmetric- key primitives...
From Keys to Databases -- Real-World Applications of Secure Multi-Party Computation
Cryptography Protocols Multi-Party Computation
2018/5/22
We discuss the widely increasing range of applications of a cryptographic technique called Multi-Party Computation. For many decades this was perceived to be of purely theoretical interest, but now it...
On Renyi Entropies and their Applications to Guessing Attacks in Cryptography
brute force guessing attacks predictability entropy
2018/5/22
We consider single and multiple attacker scenarios in guessing and obtain bounds on various success parameters in terms of Renyi entropies. We also obtain a new derivation of the union bound.