5493 search results - page 75 / 1099 » Effectively Polynomial Simulations |
117
click to vote
JOC
2000
15 years 1 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
CONCUR
2010
Springer
15 years 2 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
117
click to vote
ATVA
2007
Springer
15 years 7 months ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
127
click to vote
CRYPTO
2010
Springer
15 years 1 months ago
2010
Springer
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
107
click to vote
WSC
2001
15 years 2 months ago
2001
Simulation beginners often spend a great amount of time to accumulate the knowledge as well as the experience to overcome the technical complexity of computer simulation. Limited ...