Sciweavers

120 search results - page 7 / 24
» A Practical and Secure Communication Protocol in the Bounded...
Sort
View
EUROCRYPT
2007
Springer
14 years 1 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
CCS
2007
ACM
14 years 1 months ago
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
Ari Juels, Burton S. Kaliski Jr.
IFIP
2010
Springer
13 years 2 months ago
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems
Abstract. This paper extends existing models for collaborative systems. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. I...
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, ...
CSFW
2010
IEEE
13 years 11 months ago
Modeling and Verifying Ad Hoc Routing Protocols
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr