Sciweavers

1059 search results - page 188 / 212
» Modeling Security Protocols as Games
Sort
View
FC
2005
Springer
120views Cryptology» more  FC 2005»
14 years 1 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
ASIACRYPT
2008
Springer
13 years 9 months ago
Ambiguous Optimistic Fair Exchange
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Su...
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
CCS
2009
ACM
14 years 2 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
INFOCOM
2007
IEEE
14 years 1 months ago
SPREAD: Foiling Smart Jammers Using Multi-Layer Agility
— In this paper, we address the problem of cross-layer denial of service attack in wireless data networks. We introduce SPREAD - a novel adaptive diversification approach to pro...
Xin Liu, Guevara Noubir, Ravi Sundaram, San Tan