搜索结果: 1-15 共查到“密码学 chosen-ciphertext security”相关记录19条 . 查询时间(0.125 秒)
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption
Attribute-Based Encryption Predicate Encryption
2018/11/16
We provide generic and black box transformations from any chosen plaintext secure Attribute-Based Encryption (ABE) or One-sided Predicate Encryption system into a chosen ciphertext secure system. Our ...
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
LWE lossy trapdoor functions chosen-ciphertext security
2017/9/14
Selective opening (SO) security refers to adversaries that receive a number of ciphertexts and, after having corrupted a subset of the senders (thus obtaining the plaintexts and the senders' random co...
Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security
public key encryption key encapsulation mechanism chosen ciphertext security
2016/3/4
In PKC 2014, Dachman-Soled showed a construction of a chosen ciphertext (CCA) secure
public key encryption (PKE) scheme based on a PKE scheme which simultaneously satisfies a security
property calle...
Chosen-Ciphertext Security from Subset Sum
public-key cryptography chosen-ciphertext security subset sum
2016/1/27
We construct a public-key encryption (PKE) scheme whose
security is polynomial-time equivalent to the hardness of the Subset Sum
problem. Our scheme achieves the standard notion of indistinguishabil...
Chosen Ciphertext Security via Point Obfuscation
public key encryption lossy encryption key encapsulation mechanism
2016/1/23
In this paper, we show two new constructions of chosen ciphertext secure (CCA secure) public key encryption (PKE) from general assumptions. The key ingredient in our constructions is an obfuscator for...
Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms
public key encryption puncturable key encapsulation mechanism chosen ciphertext security
2016/1/4
In this paper, we introduce and study a new cryptographic primitive that we call puncturable key encapsulation
mechanism (PKEM), which is a special class of KEMs that satisfy some functional and secu...
Simple Chosen-Ciphertext Security from Low-Noise LPN
public-key cryptography chosen ciphertext LPN
2015/12/31
Recently, D¨ottling et al. (ASIACRYPT 2012) proposed the
first chosen-ciphertext (IND-CCA) secure public-key encryption scheme
from the learning parity with noise (LPN) assumption. In this work we
...
A Ciphertext-Policy Attribute-Based Proxy Re-Encryption with Chosen-Ciphertext Security
cryptographic protocols
2014/3/13
Ciphertext-Policy Attribute-Based Proxy Re-Encryption (CP-ABPRE) extends the traditional Proxy Re-Encryption (PRE) by allowing a semi-trusted proxy to transform a ciphertext under an access policy to ...
Secure Signatures and Chosen Ciphertext Security in a Post-Quantum World
Quantum computing signatures encryption post-quantum security chosen ciphertext security
2013/4/18
We initiate the study of quantum-secure digital signatures and quantum chosen ciphertext security. In the case of signatures, we enhance the standard chosen message query model by allowing the adversa...
Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security
Homomorphic Encryption Cyclic Groups Chosen-Ciphertext Security
2010/3/16
Chosen-Ciphertext (IND-CCA) security is generally considered the right notion of security
for a cryptosystem. Because of its central importance much e ort has been devoted to constructing
IND-CCA se...
Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
lossy trapdoor functions public-key encryption chosen-ciphertext attack
2009/11/18
Lossy Trapdoor Functions (LTDFs), introduced by Peikert and Waters (STOC 2008) have
been useful for building many cryptographic primitives. In particular, by using an LTDF that loses a
(1 ...
Noncommutative Polly Cracker-type cryptosystems and chosen-ciphertext security
Chosen-ciphertext attacks noncommutative Polly Cracker cryptosystems polynomial-based cryptography
2009/6/10
In this paper we consider chosen-ciphertext attacks against noncommutative
Polly Cracker-type cryptosystems. We present several
versions of these attacks, as well as techniques to counter them. Firs...
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Chosen Ciphertext Security Optimal Ciphertext
2009/6/9
Every public-key encryption scheme has to incorporate a certain amount of randomness
into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). The difference
bet...
Chosen-Ciphertext Security via Correlated Products
Chosen-Ciphertext Security chosen-ciphertext attacks lossy trapdoor functions
2009/6/3
We initiate the study of one-wayness under correlated products. We are interested in identify-
ing necessary and sufficient conditions for a function f and a distribution on inputs (x1; : : : ; xk),
...
Chosen-Ciphertext Security from Identity-Based Encryption
Chosen-ciphertext security Forward-secure encryption Identity-based encryption
2009/4/10
We show how to construct a CCA-secure public-key encryption scheme from any
CPA-secure identity-based encryption (IBE) scheme. Our conversion from an IBE
scheme to a CCA-secure scheme is simple, ec...