Sciweavers

370 search results - page 11 / 74
» Limits of Constructive Security Proofs
Sort
View
CCS
2007
ACM
14 years 2 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
INFOCOM
2007
IEEE
14 years 2 months ago
Limiting Sybil Attacks in Structured P2P Networks
— One practical limitation of structured peer-to-peer (P2P) networks is that they are frequently subject to Sybil attacks: malicious parties can compromise the network by generat...
Hosam Rowaihy, William Enck, Patrick McDaniel, Tom...
ECCC
2010
91views more  ECCC 2010»
13 years 8 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
AI
2010
Springer
13 years 5 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
SACMAT
2009
ACM
14 years 2 months ago
xDomain: cross-border proofs of access
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
Lujo Bauer, Limin Jia, Michael K. Reiter, David Sw...