Sciweavers

1411 search results - page 181 / 283
» Interactive Coding for Interactive Proofs
Sort
View
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 4 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen
AGI
2011
14 years 1 months ago
Real-World Limits to Algorithmic Intelligence
Abstract. Recent theories of universal algorithmic intelligence, combined with the view that the world can be completely specified in mathematical terms, have led to claims about ...
Leo Pape, Arthur Kok
JOC
2011
104views more  JOC 2011»
14 years 22 days ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
CHI
2009
ACM
15 years 10 months ago
Designing for discovery: opening the hood for open-source end user tinkering
According to the Free Software Movement, the user ought to have "the freedoms to make changes, and to publish improved versions" and "to study how the program works...
Gifford Cheung, Parmit Chilana, Shaun K. Kane, Bra...
ERSHOV
2009
Springer
15 years 4 months ago
Multi-level Virtual Machine Debugging Using the Java Platform Debugger Architecture
Abstract. Debugging virtual machines (VMs) presents unique challenges, especially meta-circular VMs, which are written in the same language they implement. Making sense of runtime ...
Thomas Würthinger, Michael L. Van De Vanter, ...