Sciweavers

3228 search results - page 218 / 646
» Computationally Sound Proofs
Sort
View
JFPLC
2004
15 years 8 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
DCC
2010
IEEE
15 years 7 months ago
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
Atefeh Mashatan, Douglas R. Stinson
DCC
2010
IEEE
15 years 7 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
JSAI
2007
Springer
16 years 1 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
CGI
1999
IEEE
15 years 11 months ago
Time Warping of Audio Signals
This paper describes a technique to obtain a time dilation or contraction of an audio signal. Different Computer Graphics applications can take advantage of this technique. In rea...
Siome Goldenstein, Jonas Gomes