769 search results - page 25 / 154 » Where Is the Proof |
101
click to vote
ORL
2008
15 years 4 months ago
2008
We consider a manufacturer serving two customer classes where one wants the item immediately and the second receives a discount to accept a delay. We show that a (S, R, B) base st...
129
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
136
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
179
click to vote
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
120
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...