550 search results - page 19 / 110 » pairing 2009 |
FSTTCS
2009
Springer
15 years 1 months ago
2009
Springer
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
We consider control systems of the type x = Ax+(t)bu, where u R, (A, b) is a controllable pair and is an unknown time-varying signal with values in [0, 1] satisfying a permanent...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
Generating accurate three dimensional planetary models is becoming increasingly more important as NASA plans manned missions to return to the moon in the next decade. This paper d...
107
click to vote
PAIRING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
82
Voted
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...