Sciweavers

837 search results - page 20 / 168
» Proof Development with OMEGA
Sort
View
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
14 years 3 months ago
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
Jonathan Katz, Yehuda Lindell
PLDI
2012
ACM
12 years 9 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
IAT
2008
IEEE
14 years 4 months ago
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Mak...
ISDA
2006
IEEE
14 years 3 months ago
From Gene to Drug: A Proof of Concept for a Plausible Computational Pathway
The last decade has witnessed an exponential growth of sequence information in the field of biological macromolecules such as proteins and nucleic acids and their interactions wit...
Sandhya Shenoy, B. Jayaram, N. Latha, Pooja Narang...
ATAL
2004
Springer
14 years 3 months ago
Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction
In this paper, we investigate a model of a combinatorial, procurement multi-attribute auction, in which each sales item is defined by several attributes called quality, the buyer...
Takayuki Suyama, Makoto Yokoo