搜索结果: 1-15 共查到“军事学 PKE”相关记录16条 . 查询时间(0.062 秒)
Generic Side-channel attacks on CCA-secure lattice-based PKE and KEM schemes
Lattice based cryptography side-channel attacks CCA transformation
font style='font-size:12px;'>
2019/8/21
In this article, we demonstrate practical side-channel assisted chosen-ciphertext attacks (CCA) over multiple CCA-secure lattice-based public-key encryption schemes (PKE) and key-encapsulation mechani...
On the efficiency of pairing-based proofs under the d-PKE
zk-SNARKs Knowledge Assumptions
font style='font-size:12px;'>
2019/2/25
We investigate the minimal number of group elements and prover running time in a zk-SNARK when using only a symmetric ``linear'' knowledge assumption, like the dd-Power Knowledge of Exponent assumptio...
Improved Lattice-based CCA2-Secure PKE in the Standard Model
public-key encryption learning with errors chosen ciphertext security
font style='font-size:12px;'>
2019/2/25
Based on the identity-based encryption (IBE) from lattices by Agrawal et al. (Eurocrypt'10), Micciancio and Peikert (Eurocrypt'12) presented a CCA1-secure public-key encryption (PKE), which has the be...
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
font style='font-size:12px;'>
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. ...
Simulation-based Receiver Selective Opening CCA Secure PKE from Standard Computational Assumptions
public key encryption receiver selective opening security chosen ciphertext security
font style='font-size:12px;'>
2018/11/12
In the situation where there are one sender and multiple receivers, a receiver selective opening (RSO) attack for a public key encryption (PKE) scheme considers adversaries that can corrupt some of th...
Round2: KEM and PKE based on GLWR
key encapsulation public key encryption lattice techniques
font style='font-size:12px;'>
2017/12/11
Cryptographic primitives that are secure against quantum computing are receiving growing attention with recent, steady advances in quantum computing and standardization initiatives in post-quantum cry...
Efficient Compilers for After-the-Fact Leakage: from CPA to CCA-2 secure PKE to AKE
After-the-Fact leakage bounded memory leakage split-state
font style='font-size:12px;'>
2017/5/25
The goal of leakage-resilient cryptography is to construct cryptographic algorithms that are secure even if the adversary obtains side-channel information from the real world implementation of these a...
Super-Strong RKA Secure MAC, PKE and SE from Tag-based Hash Proof System
related-key attack hash proof system message authentication code
font style='font-size:12px;'>
2016/12/7
In this paper, we define new RKA security notions for several cryptographic primitives including message authentication code (MAC), public-key encryption (PKE) and symmetric encryption (SE). This new ...
Fully-Secure Lattice-Based IBE as Compact as PKE
University of Maryland
font style='font-size:12px;'>
2016/2/23
We construct an identity-based encryption (IBE) scheme from the standard Learning with Errors
(LWE) assumption, which both has a compact public-key (with size similar to known lattice-based PKE
sche...
Simulation-based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
public-key cryptography selective opening
font style='font-size:12px;'>
2016/1/5
We study simulation-based, selective opening security against chosen-ciphertext attacks (SIM-SO-CCA security) for public key encryption (PKE). In a selective opening, chosen-ciphertext attack (SO-CCA)...
Lattice-Based FHE as Secure as PKE
fully homomorphic encryption lattice based cryptography
font style='font-size:12px;'>
2014/3/10
We show that (leveled) fully homomorphic encryption (FHE) can be based on the hardness of $\otild(n^{1.5+\epsilon})$-approximation for lattice problems (such as GapSVP) under quantum reductions for an...
URDP: General Framework for Direct CCA2 Security from any Lattice-Based PKE Scheme
Post-quantum cryptography Lattice-based PKE scheme Universal random data padding CCA2-security
font style='font-size:12px;'>
2013/4/18
Design efficient Lattice-based cryptosystem secure against adaptive chosen ciphertext attack (IND-CCA2) is a challenge problem. To the date, full CCA2-security of all proposed Lattice-based PKE scheme...
The Exact Security of a Stateful IBE and New Compact Stateful PKE Schemes
Stateful Identity Based Encryption Adaptive Chosen Ciphertext (CCA) Provable Security Compact Ciphertext with/without Ciphertext Verification Random Oracle model.
font style='font-size:12px;'>
2012/3/27
Recently, Baek et al. proposed a stateful identity based encryption scheme with compact ciphertext and commented that the security of the scheme can be reduced to the Computational Bilinear Diffie Hel...
Cryptanalysis and Improvement of an Efficient CCA Secure PKE Scheme
public-key cryptography
font style='font-size:12px;'>
2012/3/28
Recently in Chinese Journal of Computers, Kang et al. [12] proposed an efficient CCA secure public key encryption (PKE) scheme, and claimed that it is more efficient in the public/private keys than th...
Is it possible to have CBE from CL-PKE?
Cryptography Security analysis Certi¯ cateless Public Key Encryption
font style='font-size:12px;'>
2009/3/18
Recently, Al-Riyami and Paterson proposed a generic con-
version from CL-PKE (Certificateless Public Key Encryption) to CBE
(Certificate Based Encryption) and claimed that the derived CBE scheme
is...