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
Attacking and Defending the McEliece Cryptosystem
TL;DR: New parameters for the McEliece and Niederreiter cryptosystems achieving standard levels of security against all known attacks are proposed, and the resulting public-key sizes are considerably smaller than previous parameter choices for the same level of security.
Book
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
TL;DR: In this paper, the Jacobi model of an elliptic curve and side-channel analysis was used to construct low-density Parity-Check Codes with Two Information Symbols.
Book ChapterDOI
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
TL;DR: This work proposes a slightly weaker notion of security, saying that no partial information about encrypted messages should be leaked as long as each message is a-priori hard-to-guess given the others, and shows equivalence of this definition to single-message and indistinguishability-based ones, which are easier to work with.
Book ChapterDOI
Security Bounds for the Design of Code-Based Cryptosystems
TL;DR: Lower bounds are given on the work factor of idealized versions of code-based cryptography algorithms, taking into account all possible tweaks which could improve their practical complexity.
Posted Content
Attacking and defending the McEliece cryptosystem
TL;DR: In this article, the authors presented several improvements to Stern's attack on the McEliece cryptosystem and achieved results considerably better than Canteaut et al. This attack has been implemented and is now in progress.