Sciweavers

220 search results - page 18 / 44
» ideal 2005
Sort
View
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
14 years 4 months ago
Generalized normal forms and polynomial system solving
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 ...
Bernard Mourrain
ISW
2005
Springer
14 years 4 months ago
Universally Composable Time-Stamping Schemes with Audit
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...
Ahto Buldas, Peeter Laud, Märt Saarepera, Jan...
LPAR
2005
Springer
14 years 4 months ago
Incremental Integrity Checking: Limitations and Possibilities
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...
Henning Christiansen, Davide Martinenghi
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
14 years 4 months ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
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...
Louis Granboulan
PKC
2005
Springer
192views Cryptology» more  PKC 2005»
14 years 4 months ago
Securing RSA-KEM via the AES
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...
Jakob Jonsson, Matthew J. B. Robshaw