Sciweavers

16844 search results - page 157 / 3369
» How to Design Programs
Sort
View
ASIACRYPT
2007
Springer
16 years 17 days ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
16 years 17 days ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 17 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
HRI
2006
ACM
16 years 10 days ago
How contingent should a communication robot be?
The purpose of our research is to develop lifelike behavior in a communication robot, which is expected to potentially make human-robot interaction more natural. Our previous rese...
Fumitaka Yamaoka, Takayuki Kanda, Hiroshi Ishiguro...
IUI
2006
ACM
16 years 10 days ago
How to talk to a hologram
There is a growing need for creating life-like virtual human simulations that can conduct a natural spoken dialog with a human student on a predefined subject. We present an over...
Anton Leuski, Jarrell Pair, David R. Traum, Peter ...