Book ChapterDOI
Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
K. Preetha Mathew,Sachin Vasant,C. Pandu Rangan +2 more
- pp 517-535
TLDR
The proposed constructions are the first of its kind under coding-based assumption in the standard model that do not use the \(\kappa \)-repetition paradigm initiated by Rosen and Segev at Theory of Cryptography Conference (TCC), 2009.Abstract:
In this paper, we propose an IND-CCA2 secure Key-Encapsulation (KEM) in the standard model using the Niederreiter Encryption scheme. Also, we propose a PRIV-1CCA secure deterministic variant of the Niederreiter encryption scheme in the standard model. The security of these constructions are reduced to the hardness of the Syndrome Decoding problem and the Goppa Code Distinguishability problem. To the best of our knowledge, the proposed constructions are the first of its kind under coding-based assumption in the standard model that do not use the \(\kappa \)-repetition paradigm initiated by Rosen and Segev at Theory of Cryptography Conference (TCC), 2009.read more
Citations
More filters
Book
Advances in cryptology -- EUROCRYPT 2010 : 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30-June 3, 2010 : proceedings
TL;DR: Cryptosystems I and II: Cryptography between Wonderland and Underland as discussed by the authors, a simple BGN-type Cryptosystem from LWE, or Bonsai Trees, or how to delegate a Lattice Basis.
Book
Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers
TL;DR: A Privacy Protection Scheme for a Scalable Control Method in Context-Dependent Services is proposed in this paper, where the GPS Identification Scheme using Frobenius Expansions and Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256 are discussed.
References
More filters
Book ChapterDOI
Using hash functions as a hedge against chosen ciphertext attack
TL;DR: A practical hybrid scheme is presented that is just as efficient as the scheme of of Cramer and Shoup and is slightly more efficient than the one originally presented, and it is proved that the scheme is secure if the Decisional Diffie-Hellman assumption is true.
Book ChapterDOI
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
TL;DR: In this article, the authors strengthen the foundations of deterministic public-key encryption via definitional equivalences and standard-model constructs based on general assumptions, and show relations between deterministic and standard (randomized) encryption.
Book ChapterDOI
Chosen-Ciphertext Security via Correlated Products
Alon Rosen,Gil Segev +1 more
TL;DR: This study shows that any collection of injective trapdoor functions that is secure under a very natural correlated product can be used to construct a CCA-secure encryption scheme.
Posted Content
A Distinguisher for High Rate McEliece Cryptosystems.
TL;DR: This work presents the first method allowing to distinguish alternant and Goppa codes over any field, and can solve the GD problem in polynomial time provided that the codes have sufficiently large rates.
Journal ArticleDOI
Semantic security for the McEliece cryptosystem without random oracles
TL;DR: It is formally proved that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and its dual, the Niederreiter) cryptosystems under the standard assumptions.