Sciweavers

233 search results - page 27 / 47
» Interactive Proofs For Quantum Computations
Sort
View
LICS
2009
IEEE
15 years 6 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
FOCS
2002
IEEE
15 years 4 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
76
Voted
EICS
2009
ACM
15 years 6 months ago
Interactive usability instrumentation
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...
Scott Bateman, Carl Gutwin, Nathaniel Osgood, Gord...
DATE
2010
IEEE
131views Hardware» more  DATE 2010»
15 years 4 months ago
Spinto: High-performance energy minimization in spin glasses
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
Héctor J. Garcia, Igor L. Markov
SSS
2009
Springer
195views Control Systems» more  SSS 2009»
15 years 6 months ago
Anonymous Transactions in Computer Networks
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
Shlomi Dolev, Marina Kopeetsky