搜索结果: 1-14 共查到“军队指挥学 secure encryption”相关记录14条 . 查询时间(0.156 秒)
Saber: Module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
CPA-secure encryption CCA-secure KEM
2018/3/5
In this paper, we introduce Saber, a package of cryptographic primitives whose security relies on the hardness of the Module Learning With Rounding problem (Mod-LWR). We first describe a secure Diffie...
A hash function family is called correlation intractable if for all sparse relations, it is hard to find, given a random function from the family, an input-output pair that satisfies the relation (Can...
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes
KDM security IBE LPN
2017/10/9
Finally, we show that the notion of one-time signatures with encryption is also useful for the construction of key-dependent-message (KDM) secure public-key encryption. In particular, our results impl...
A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption
Non-Malleable Encryption Semantically Secure Encryption
2016/7/22
We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasi-linear blow-up in the size of the ciphertext. This impr...
Tightly Secure CCA-Secure Encryption without Pairings
public-key encryption CCA security tightness
2016/2/23
We present the first CCA-secure public-key encryption scheme based on DDH where the
security loss is independent of the number of challenge ciphertexts and the number of decryption queries.
Our cons...
Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security
CCA-secure encryption multi-user multi-challenge
2016/1/7
To gain strong confidence in the security of a public-key scheme, it is most desirable for the
security proof to feature a tight reduction between the adversary and the algorithm solving the underlyi...
High Performance Lattice-based CCA-secure Encryption
Lattice-Based Cryptography Encryption Scheme Lattice-Based Assumptions
2016/1/4
Lattice-based encryption schemes still suffer from a low message throughput per ciphertext. This is mainly
due to the fact that the underlying schemes do not tap the full potentials of LWE. Many cons...
RKA-KDM secure encryption from public-key encryption
related key attacks key-dependent message security garbled circuits
2014/3/7
We construct secret-key encryption (SKE) schemes that are secure against related-key attacks and in the presence of key-dependent messages (RKA-KDM secure). We emphasize that RKA-KDM security is not m...
Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
simulation-soundness chosen-ciphertext security
2014/3/6
Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most e...
Compact CCA-Secure Encryption with Ciphertext Verifiability
Adaptive Chosen Ciphertext Secure (CCA), Provable Security, CCA with Ciphertext Indistinguishability
2011/7/25
While CCA secure encryption schemes that provide ciphertext indistinguishability offer strongest form of message secrecy, the integrity of the ciphertext is often overlooked.
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
CCA Secure Encryption Oblivious Third Parties
2011/7/25
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations.
Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties
cryptographic protocols / public-key encryption structure preserving oblivious party
2012/3/27
In this paper we present the first public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular it does not use hash-functions o...
Circular-Secure Encryption Beyond Affine Functions
Circular-Secure Encryption Affine Functions
2009/10/9
We show that for any constant d 2 N, there exists a public-key encryption scheme that
can securely encrypt any function f of its own secret-key, assuming f can be expressed as a
polynomial of total ...
Chosen-ciphertext Secure Encryption from Hard Algebraic Set Systems
public-key encryption chosen-ciphertext security
2009/6/12
We put forward the new abstract framework of hard algebraic set systems that allows
to construct e cient chosen-ciphertext secure encryption schemes under computational (rather
than decisional) intr...