Sciweavers

1274 search results - page 59 / 255
» New Proofs for
Sort
View
FOCS
2009
IEEE
15 years 7 months ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...
Yi Deng, Vipul Goyal, Amit Sahai
BMCBI
2008
111views more  BMCBI 2008»
15 years 22 days ago
SciDBMaker: new software for computer-aided design of specialized biological databases
Background: The exponential growth of research in molecular biology has brought concomitant proliferation of databases for stocking its findings. A variety of protein sequence dat...
Riadh Hammami, Abdelmajid Zouhir, Karim Naghmouchi...
234
Voted
POPL
2001
ACM
16 years 28 days ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
100
Voted
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
15 years 7 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 7 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...