Sciweavers

182 search results - page 14 / 37
» The Secret Art of Computer Programming
Sort
View
ICALP
2005
Springer
14 years 27 days ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 2 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
TRUST
2010
Springer
14 years 13 days ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
IACR
2011
115views more  IACR 2011»
12 years 7 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky
VL
2000
IEEE
130views Visual Languages» more  VL 2000»
13 years 11 months ago
SALSA and ALVIS: A Language and System for Constructing and Presenting Low Fidelity Algorithm Visualizations
Computer science educators have traditionally used algorithm visualization (AV) software to create graphical representations of algorithms that are later used as visual aids in le...
Christopher D. Hundhausen, Sarah A. Douglas