Sciweavers

793 search results - page 89 / 159
» Argumentation and standards of proof
Sort
View
CCS
2008
ACM
14 years 1 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ICFP
2007
ACM
14 years 11 months ago
Ott: effective tool support for the working semanticist
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
Peter Sewell, Francesco Zappa Nardelli, Scott Owen...
PODC
2003
ACM
14 years 4 months ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
ECOOP
2009
Springer
14 years 11 months ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio
LPAR
2007
Springer
14 years 5 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...