Sciweavers

713 search results - page 77 / 143
» Dispersing Hash Functions
Sort
View
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
13 years 5 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
NAR
2006
98views more  NAR 2006»
14 years 9 months ago
oGNM: online computation of structural dynamics using the Gaussian Network Model
An assessment of the equilibrium dynamics of biomolecular systems, and in particular their most cooperativefluctuationsaccessibleundernativestate conditions, is a first step towar...
Lee-Wei Yang, A. J. Rader, Xiong Liu, Christopher ...
EIT
2008
IEEE
15 years 4 months ago
Relating Boolean gate truth tables to one-way functions
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
Mahadevan Gomathisankaran, Akhilesh Tyagi
CHES
2007
Springer
94views Cryptology» more  CHES 2007»
15 years 4 months ago
MAME: A Compression Function with Reduced Hardware Requirements
This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 25...
Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, J...
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
15 years 1 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...