Sciweavers

94 search results - page 9 / 19
» New lattice based cryptographic constructions
Sort
View
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 1 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
EUROCRYPT
2003
Springer
14 years 3 months ago
A Framework for Password-Based Authenticated Key Exchange
Abstract. In this paper we present a general framework for passwordbased authenticated key exchange protocols, in the common reference odel. Our protocol is actually an abstraction...
Rosario Gennaro, Yehuda Lindell
ASIACRYPT
2009
Springer
14 years 4 months ago
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi,...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
14 years 1 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
EUROCRYPT
2010
Springer
14 years 2 months ago
Public-Key Encryption in the Bounded-Retrieval Model
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. In th...
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Se...