Results 1  10
of
91,714
Latticebased Cryptography
, 2008
"... In this chapter we describe some of the recent progress in latticebased cryptography. Latticebased cryptographic constructions hold a great promise for postquantum cryptography, as they enjoy very strong security proofs based on worstcase hardness, relatively efficient implementations, as well a ..."
Abstract

Cited by 67 (5 self)
 Add to MetaCart
In this chapter we describe some of the recent progress in latticebased cryptography. Latticebased cryptographic constructions hold a great promise for postquantum cryptography, as they enjoy very strong security proofs based on worstcase hardness, relatively efficient implementations, as well
Latticebased cryptography
 In Proc. of the 26th Annual International Cryptology Conference (CRYPTO
, 2006
"... Abstract. We describe some of the recent progress on latticebased cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptographic schemes. 1 ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Abstract. We describe some of the recent progress on latticebased cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptographic schemes. 1
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
 In STOC
, 2005
"... Our main result is a reduction from worstcase lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli. It can also be viewed as the problem of decoding from a random linear co ..."
Abstract

Cited by 366 (6 self)
 Add to MetaCart
(classical) publickey cryptosystem whose security is based on the hardness of the learning problem. By the main result, its security is also based on the worstcase quantum hardness of SVP and SIVP. Previous latticebased publickey cryptosystems such as the one by Ajtai and Dwork were based only on unique
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 548 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
Bonsai trees (or, arboriculture in latticebased cryptography)
, 2009
"... We introduce bonsai trees, a latticebased cryptographic primitive that we apply to resolve some important open problems in the area. Applications of bonsai trees include: • An efficient, stateless ‘hashandsign’ signature scheme in the standard model (i.e., no random oracles), and • The first hier ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We introduce bonsai trees, a latticebased cryptographic primitive that we apply to resolve some important open problems in the area. Applications of bonsai trees include: • An efficient, stateless ‘hashandsign’ signature scheme in the standard model (i.e., no random oracles), and • The first
NEW TRENDS IN LATTICEBASED CRYPTOGRAPHY
"... Abstract. Latticebased cryptography has undergone rapid development in recent years and is very attractive due to the low asymptotic complexity and potential resistence to quantum computing attacks. This paper is intended to be a survey of the lattice problems which underlay many recent cryptograph ..."
Abstract
 Add to MetaCart
Abstract. Latticebased cryptography has undergone rapid development in recent years and is very attractive due to the low asymptotic complexity and potential resistence to quantum computing attacks. This paper is intended to be a survey of the lattice problems which underlay many recent
Practical latticebased cryptography: NTRUEncrypt . . .
"... We provide a brief history and overview of lattice based cryptography and cryptanalysis: shortest vector problems, closest vector problems, subset sum problem and knapsack systems, GGH, AjtaiDwork and NTRU. A detailed discussion of the algorithms NTRUEncrypt and NTRUSign follows. These algorithms h ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We provide a brief history and overview of lattice based cryptography and cryptanalysis: shortest vector problems, closest vector problems, subset sum problem and knapsack systems, GGH, AjtaiDwork and NTRU. A detailed discussion of the algorithms NTRUEncrypt and NTRUSign follows. These algorithms
Complete discrete 2D Gabor transforms by neural networks for image analysis and compression
, 1988
"... AbstractA threelayered neural network is described for transforming twodimensional discrete signals into generalized nonorthogonal 2D “Gabor ” representations for image analysis, segmentation, and compression. These transforms are conjoint spatiahpectral representations [lo], [15], which provide ..."
Abstract

Cited by 475 (8 self)
 Add to MetaCart
to compute because t e elementary expansion functions are not orthogonal. One orthogonking approach developed for 1D signals by Bastiaans [SI, based on biorthonormal expansions, is restricted by constraints on the conjoint sampling rates and invariance of the windowing function, as well as by the fact
Results 1  10
of
91,714