Sciweavers

488 search results - page 38 / 98
» Policy-Based Cryptography and Applications
Sort
View
EUROCRYPT
2010
Springer
14 years 3 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
14 years 3 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 3 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
ISSAC
1992
Springer
114views Mathematics» more  ISSAC 1992»
14 years 2 months ago
Parallel Lattice Basis Reduction
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
Gilles Villard
MSV
2004
14 years 7 days ago
On the Conversion between Number Systems
This brief revisits the problem of conversion between number systems and asks the following question: given a nonnegative decimal number , what is the value of the digit at positio...
Houssain Kettani