Sciweavers

224 search results - page 10 / 45
» Secure Computation from Random Error Correcting Codes
Sort
View
ASPLOS
2008
ACM
13 years 8 months ago
Archipelago: trading address space for reliability and security
Memory errors are a notorious source of security vulnerabilities that can lead to service interruptions, information leakage and unauthorized access. Because such errors are also ...
Vitaliy B. Lvin, Gene Novark, Emery D. Berger, Ben...
SP
2006
IEEE
193views Security Privacy» more  SP 2006»
14 years 21 days ago
Analysis of the Linux Random Number Generator
Linux is the most popular open source project. The Linux random number generator is part of the kernel of all Linux distributions and is based on generating randomness from entrop...
Zvi Gutterman, Benny Pinkas, Tzachy Reinman
PST
2008
13 years 8 months ago
Encoding the Program Correctness Proofs as Programs in PCC Technology
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
Heidar Pirzadeh, Danny Dubé
ICN
2001
Springer
13 years 11 months ago
Secure Communication: A New Application for Active Networks
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...
Manuel Günter, Marc Brogle, Torsten Braun
FOCS
2006
IEEE
14 years 23 days ago
Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
Michael Ben-Or, Claude Crépeau, Daniel Gott...