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
Reads0
Chats0
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
Polynominal time algorithms for discrete logarithms and factoring on a quantum computer
Book ChapterDOI
More constructions of lossy and correlation-secure trapdoor functions
TL;DR: This work presents the first construction that is based solely on the quadratic residuosity assumption, and guarantees essentially any required amount of lossiness, where at the same time the functions are more efficient than the matrix-based approach of Peikert and Waters.
Proceedings ArticleDOI
A distinguisher for high rate McEliece cryptosystems
TL;DR: In this article, it was shown that the dimension of the solution space of a linearized system deduced from a particular polynomial system describing a key-recovery problem depends on the type of code, and explicit formulas derived from extensive experimentations for the value of the dimension are provided for generic random, alternant, and Goppa code over any alphabet.
Book ChapterDOI
A unified approach to deterministic encryption: new constructions and a connection to computational entropy
TL;DR: A general construction of deterministic encryption schemes that unifies prior work and gives novel schemes, and extends the result about computational entropy to the average case, which is useful in reasoning about leakage-resilient cryptography.