Sciweavers

397 search results - page 34 / 80
» Pseudorandom Functions and Lattices
Sort
View
CRYPTO
1997
Springer
207views Cryptology» more  CRYPTO 1997»
15 years 5 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
SIBGRAPI
1999
IEEE
15 years 5 months ago
Developing Morphological Building Blocks: From Design to Implementation
Abstract. Mathematical morphology has become a widely used technique for image processing and computer vision. Initially designed as a set theory, it was generalized to the set of ...
Marcos Cordeiro d'Ornellas, Rein van den Boomgaard
IPPS
2005
IEEE
15 years 6 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
15 years 6 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
EUROCRYPT
2009
Springer
16 years 1 months ago
Order-Preserving Symmetric Encryption
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
Alexandra Boldyreva, Nathan Chenette, Younho Lee, ...