661 search results - page 41 / 133 » Argument Reduction by Factoring |
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
SOSP
1997
ACM
14 years 11 months ago
1997
ACM
Abstract: Transactions and recoverable memories are powerful mechanisms for handling failures and manipulating persistent data. Unfortunately, standard recoverable memories incur a...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
This paper aims at proposing a general formal framework for dialogue between autonomous agents which are looking for a common agreement about a collective choice. The proposed set...
ACL
2010
14 years 7 months ago
2010
This paper improves the use of pseudowords as an evaluation framework for selectional preferences. While pseudowords originally evaluated word sense disambiguation, they are now c...
ISSRE
2006
IEEE
15 years 3 months ago
2006
IEEE
Test suite reduction uses test requirement coverage to determine if the reduced test suite maintains the original suite’s requirement coverage. Based on observations from our pr...