Sciweavers

469 search results - page 61 / 94
» On Adversary Models and Compositional Security
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
WWW
2006
ACM
14 years 8 months ago
Capturing the essentials of federated systems
Today, the Web is increasingly used as a platform for distributed services, which transcend organizational boundaries to form federated applications. Consequently, there is a grow...
Alexander Brändle, Frederic Majer, Johannes M...
COLCOM
2008
IEEE
13 years 9 months ago
Mashup Model and Verification Using Mashup Processing Network
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
Ehtesham Zahoor, Olivier Perrin, Claude Godart
ATAL
2010
Springer
13 years 8 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...