608 search results - page 69 / 122 » Interactive Oracle Proofs |
159
click to vote
PPDP
1999
Springer
15 years 7 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
100
click to vote
EICS
2009
ACM
15 years 9 months ago
2009
ACM
Usage data logged from user interactions can be extremely valuable for evaluating software usability. However, instrumenting software to collect usage data is a time-intensive tas...
138
click to vote
FC
2008
Springer
15 years 4 months ago
2008
Springer
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a pri...
129
click to vote
ECCC
2008
15 years 3 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
148
click to vote
ICTAC
2009
Springer
15 years 22 days ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...