Sciweavers

610 search results - page 56 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
SPW
1999
Springer
15 years 4 months ago
Performance of Protocols
This paper presents a comprehensive study on the performance of common MANET (mobile ad hoc network) routing protocols under realistic network scenarios. The routing protocols use...
Michael Roe
EUROCRYPT
2010
Springer
15 years 4 months ago
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
Rafael Pass, Hoeteck Wee
ESORICS
2009
Springer
16 years 14 days ago
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Abstract. Diagnostic and classification algorithms play an important role in data analysis, with applications in areas such as health care, fault diagnostics, or benchmarking. Bran...
Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov...
DSN
2002
IEEE
15 years 4 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo