Sciweavers

268 search results - page 32 / 54
» Equivalence for the G3'-stable models semantics
Sort
View
QEST
2008
IEEE
14 years 1 months ago
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
Josée Desharnais, François Laviolett...
STACS
2009
Springer
14 years 2 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
INDOCRYPT
2004
Springer
14 years 27 days ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...
JELIA
2004
Springer
14 years 27 days ago
On the Relation Between ID-Logic and Answer Set Programming
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
Maarten Mariën, David Gilis, Marc Denecker
CRYPTO
2001
Springer
155views Cryptology» more  CRYPTO 2001»
14 years 1 days ago
RSA-OAEP Is Secure under the RSA Assumption
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointch...