Sciweavers

27 search results - page 5 / 6
» ci 2005
Sort
View
PKC
2005
Springer
89views Cryptology» more  PKC 2005»
13 years 10 months ago
A New Related Message Attack on RSA
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
Oded Yacobi, Yacov Yacobi
ATAL
2005
Springer
13 years 10 months ago
A logic for strategic reasoning
Rational strategic reasoning is the process whereby an agent reasons about the best strategy to adopt in a given multi-agent scenario, taking into account the likely behaviour of ...
Wiebe van der Hoek, Wojciech Jamroga, Michael Wool...
CADE
2005
Springer
14 years 5 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
ICALP
2005
Springer
13 years 10 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman