Sciweavers

407 search results - page 81 / 82
» Malleable Proof Systems and Applications
Sort
View
EUROCRYPT
2004
Springer
13 years 10 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
ICAIL
2003
ACM
13 years 10 months ago
Specifying and Reasoning with Institutional Agents
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
Filipe Santos, Olga Pacheco
ACSAC
2001
IEEE
13 years 8 months ago
Verifiable Identifiers in Middleware Security
fies a number of issues related to security information r semantics on different layers of abstraction. In particular it is difficult to express caller and target accurately in the...
Ulrich Lang, Dieter Gollmann, Rudolf Schreiner
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 6 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 4 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...