Sciweavers

48 search results - page 9 / 10
» Computing Inverses over a Shared Secret Modulus
Sort
View
ASIACRYPT
2001
Springer
13 years 10 months ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
CORR
2011
Springer
143views Education» more  CORR 2011»
12 years 10 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
ICCSA
2007
Springer
14 years 13 days ago
An Enhanced One-Round Pairing-Based Tripartite Authenticated Key Agreement Protocol
A tripartite authenticated key agreement protocol is generally designed to accommodate the need of three specific entities in communicating over an open network with a shared secre...
Meng-Hui Lim, Sanggon Lee, Youngho Park, Hoonjae L...
WIMOB
2007
IEEE
14 years 16 days ago
A New Protocol for Securing Wireless Sensor Networks against Nodes Replication Attacks
—The low-cost, unattended nature and the capability of self-organizing of sensors, yield the use of Wireless Sensor Networks (WSN) very popular to day. Unfortunately, the unshiel...
Chakib Bekara, Maryline Laurent-Maknavicius
EUROCRYPT
2006
Springer
13 years 10 months ago
Our Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSher...