Sciweavers

1059 search results - page 168 / 212
» Modeling Security Protocols as Games
Sort
View
EXPCS
2007
14 years 1 months ago
Experimental economics and experimental computer science: a survey
In surprisingly many computer science research projects, system outcomes may be influenced by computerized or human agents with different economic incentives. Such studies include...
Jens Grossklags
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
OOPSLA
2007
Springer
14 years 4 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich
CSFW
2008
IEEE
14 years 4 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
ENTCS
2006
117views more  ENTCS 2006»
13 years 10 months ago
A Formalization of Credit and Responsibility Within the GNDC Schema
We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through ...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...