Sciweavers

138 search results - page 14 / 28
» A Practical Secure Physical Random Bit Generator
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 7 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
ICCAD
2002
IEEE
143views Hardware» more  ICCAD 2002»
14 years 3 months ago
A Markov chain sequence generator for power macromodeling
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
Xun Liu, Marios C. Papaefthymiou
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 27 days ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
Ueli M. Maurer, Stefano Tessaro
PROVSEC
2007
Springer
14 years 25 days ago
Stronger Security of Authenticated Key Exchange
In this paper we study security deļ¬nitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin
ACISP
2007
Springer
14 years 28 days ago
Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
Mohammad Reza Reyhanitabar, Shuhong Wang, Reihaneh...