Sciweavers

94 search results - page 4 / 19
» New lattice based cryptographic constructions
Sort
View
DBWORKSHOPS
1992
13 years 11 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
FOCS
2006
IEEE
14 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
14 years 1 months ago
Public-Key Cryptosystems from Lattice Reduction Problems
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
Oded Goldreich, Shafi Goldwasser, Shai Halevi
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
14 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
ICASSP
2011
IEEE
13 years 1 months ago
Two dimensional nested arrays on lattices
In this paper, we develop the theory of a new class of two dimensional arrays with sensors on lattice(s) which can be used to construct a virtual array of much larger size through...
Piya Pal, Palghat P. Vaidyanathan