搜索结果: 1-15 共查到“Decryption”相关记录41条 . 查询时间(0.125 秒)
This work introduces a new class of Algorithm Substitution Attack (ASA) on Symmetric Encryption Schemes. ASAs were introduced by Bellare, Paterson and Rogaway in light of revelations concerning mass s...
Abstract. The extremely efficient Rabin-Williams signature scheme relies on decryption of a quadratic equation in order to retrieve the original message. Customarily, square roots are found using the ...
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles
Fully-Homomorphic Encryption High-Rate Time-Lock Puzzles
2019/6/19
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we present ...
A Central Limit Framework for Ring-LWE Decryption
Ring-LWE Central Limit Theorem δ-subgaussian
2019/5/9
The purpose of this paper is to use a Central Limit approach to develop a statistical framework for analysing ciphertexts in Ring-LWE homomorphic encryption schemes. This statistical framework gives r...
A Generic Attack on Lattice-based Schemes using Decryption Errors with Application to ss-ntru-pke
Lattice-based cryptography NIST post-quantum standardization decryption error
2019/1/19
Hard learning problems are central topics in recent cryptographic research. Many cryptographic primitives relate their security to difficult problems in lattices, such as the shortest vector problem. ...
Excalibur Key-Generation Protocols For DAG Hierarchic Decryption
public key cryptography multiparty computation fully homomorphic encryption
2018/12/3
Public-key cryptography applications often require structuring decryption rights according to some hierarchy. This is typically addressed with re-encryption procedures or relying on trusted parties, i...
On the impact of decryption failures on the security of LWE/LWR based schemes
Lattice cryptography Post-quantum cryptography Decryption failures
2018/11/12
In this paper we investigate the impact of decryption failures on the chosen-ciphertext security of (Ring/Module)-Learning With Errors and (Ring/Module)-Learning with Rounding based primitives. Our an...
Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme
cryptographic protocols post-quantum cryptosystem
2018/11/2
We show how to build distributed key generation and distributed decryption procedures for the LIMA Ring-LWE based post-quantum cryptosystem. Our protocols implement the CCA variants of distributed dec...
Lattice-based Revocable (Hierarchical) IBE with Decryption Key Exposure Resistance
RIBE DKER
2018/5/11
Revocable identity-based encryption (RIBE) is an extension of IBE that supports a key revocation mechanism; an indispensable feature for practical cryptographic schemes. Due to this extra feature, RIB...
Zero-Knowledge Proof of Decryption for FHE Ciphertexts
zero knowledge fully homomorphic encryption verifiable decryption
2018/1/11
Zero-knowledge proofs of knowledge and fully-homomorphic encryption are two areas that have seen considerable advances in recent years, and these two techniques are used in conjunction in the context ...
Total Break of the Fully Homomorphic Multivariate Encryption Scheme of 2017/458: Decryption can not be of low degree
Multivariate Cryptography Fully Homomorphic Encryption Eprint 2017/458
2017/5/31
Total Break of the Fully Homomorphic Multivariate Encryption Scheme of 2017/458: Decryption can not be of low degree.
Lattice-based Revocable Identity-based Encryption with Bounded Decryption Key Exposure Resistance
RIBE DKER
2017/4/17
A revocable identity-based encryption (RIBE) scheme, proposed by Boldyreva et al.\ (CCS'08), provides a revocation functionality for managing a number of users dynamically and efficiently. To capture ...
Atomic-AES: A Compact Implementation of the AES Encryption/Decryption Core
AES 128 Serialized Implementation
2016/12/8
The implementation of the AES encryption core by Moradi
et al. at Eurocrypt 2011 is one of the smallest in terms of gate area.
The circuit takes around 2400 gates and operates on an 8 bit datapath.
...
Decryption phase in Norwegian electronic voting
electronic voting protocols verifiable shuffle
2016/12/8
We describe an efficient and secure decryption protocol to the
Norwegian Internet voting project. We first adapt Groth’s shuffledecryption
from 2010 to our purpose, and we prove all security
proper...
New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
Revocable identity-based encryption static assumptions asymmetric pairings
2016/12/7
Revoking corrupted users is a desirable functionality for cryptosystems. Since Boldyreva,
Goyal, and Kumar (ACM CCS 2008) proposed a notable result for scalable revocation method in
identity-based e...