Sciweavers

4529 search results - page 113 / 906
» Position Based Cryptography
Sort
View
EUROCRYPT
2004
Springer
15 years 11 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
PERVASIVE
2004
Springer
15 years 11 months ago
A Fault-Tolerant Key-Distribution Scheme for Securing Wireless Ad Hoc Networks
We propose a novel solution for securing wireless ad-hoc networks. Our goal is to provide secure key exchange in the presence of device failures and denial-of-service attacks. The ...
Arno Wacker, Timo Heiber, Holger Cermann, Pedro Jo...
PKC
2004
Springer
146views Cryptology» more  PKC 2004»
15 years 11 months ago
Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model
Abstract. In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construc...
Huafei Zhu
DATE
2003
IEEE
88views Hardware» more  DATE 2003»
15 years 11 months ago
Ubiquitous Access to Reconfigurable Hardware: Application Scenarios and Implementation Issues
This paper presents an approach for the integration of reconfigurable hardware and computer applications based on the concept of ubiquitous computing. The goal is to allow a netwo...
Leandro Soares Indrusiak, Florian Lubitz, Ricardo ...
EUROCRYPT
2003
Springer
15 years 11 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas