搜索结果: 1-15 共查到“Key-Exposure”相关记录16条 . 查询时间(0.194 秒)
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience
public-key cryptography lattice-based cryptography leakage resilience
2018/11/12
Introduce the search and decision Leaky-RLWE assumptions (Leaky-SRLWE, Leaky-DRLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transfor...
Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
public-key cryptography RSA
2018/5/28
Thus far, several lattice-based algorithms for partial key exposure attacks on RSA, i.e., given the most/least significant bits (MSBs/LSBs) of a secret exponent dd and factoring an RSA modulus NN, hav...
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...
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 ...
A Tool Kit for Partial Key Exposure Attacks on RSA
(Multi-Prime) RSA partial key exposure lattices
2016/12/7
Thus far, partial key exposure attacks on RSA have been intensively studied using lattice based Coppersmith's methods. In the context, attackers are given partial information of a secret exponent and ...
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...
Certificateless Key Insulated Encryption: Cryptographic Primitive for Achieving Key-escrow free and Key-exposure Resilience
Bilinear Pairing Certificateless cryptography Key insulated
2016/5/24
Certificateless encryption (CLE) alleviates the heavy certificate management in traditional public key encryption and the key escrow problem in the ID-based encryption simultaneously. Current CLE sche...
A New Partial Key Exposure Attack on Multi-power RSA
Multi-power RSA Integer factorization Partial key exposure
2015/12/29
An important attack on multi-power RSA (N = p
r
q) was
introduced by Sarkar in 2014, by extending the small private exponent
attack of Boneh and Durfee on classical RSA. In particular, he showed
...
Identity-Based Chameleon Hash Scheme Without Key Exposure
Chameleon hashing Identity-based system Key exposure
2009/8/18
In this paper, we propose the first identity-based chameleon hash
scheme without key exposure, which gives a positive answer for the open problem
introduced by Ateniese and de Medeiros in 2004.
Comments and Improvements on Chameleon Hashing Without Key Exposure Based on Factoring
Chameleon hashing Factoring problem Key exposure
2009/7/14
In this paper, we present some security
aws of the key-
exposure free chameleon hash scheme based on factoring [9]. Besides, we
propose an improved chameleon hash scheme without key exposure based...
Key-Exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems
Chameleon hashing Gap Diffie-Hellman group Key exposure
2009/6/11
Chameleon signatures are based on well established hash-and-sign
paradigm, where a chameleon hash function is used to compute the cryptographic
message digest. Chameleon signatures simultaneously pr...
Protecting against Key Exposure:Strongly Key-Insulated Encryption with Optimal Threshold
Key exposure key update encryption
2009/4/14
A new framework for protection against key exposure was recently suggested by Dodis
et. al. [16]. We take its realization further towards practice by presenting simple new schemes
that provide benef...
Upper Bounds for the Selection of the Cryptographic Key Lifetimes: Bounding the Risk of Key Exposure in the Presence of Faults
Key Lifetimes Fault-Attacks Dependability Security Policies Cryptographic Key Failure Tolerance
2009/4/2
With physical attacks threatening the security of current
cryptographic schemes, no security policy can be developed without taking
into account the physical nature of computation.
In this article ...
On the Key Exposure Problem in Chameleon Hashes
Digital signatures undeniable signatures collision-resistant hashing
2009/3/27
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature
schemes that provide non-transferability. However, that first construction employs a
chameleon hash that s...
Chameleon Hashing without Key Exposure
Chameleon hashing Gap Diffie-Hellman group Key exposure Digital signatures
2009/3/23
Chameleon signatures are based on well established hashand-
sign paradigm, where a chameleon hash function is used to compute
the cryptographic message digest. Chameleon signatures simultaneously
p...