220 search results - page 18 / 44 » ideal 2005 |
127
click to vote
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
131
click to vote
ISW
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a universally composable time-stamping scheme based on universal one-way hash functions. The model we use contains an ideal auditing functionality (implementab...
144
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be...
148
Voted
PKC
2005
Springer
15 years 10 months ago
2005
Springer
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
153
Voted
PKC
2005
Springer
15 years 10 months ago
2005
Springer
RSA-KEM is a popular key encapsulation mechanism that combines the RSA trapdoor permutation with a key derivation function (KDF). Often the details of the KDF are viewed as orthogo...