719 search results - page 92 / 144 » Proving Security Protocols Correct |
SRDS
1999
IEEE
15 years 2 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
ASPLOS
2012
ACM
13 years 5 months ago
2012
ACM
Processor emulators are widely used to provide isolation and instrumentation of binary software. However they have proved difficult to implement correctly: processor specificati...
70
Voted
EUROSYS
2010
ACM
15 years 6 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
BIBM
2007
IEEE
15 years 1 months ago
2007
IEEE
The tridimensional structure of a protein is constrained or stabilized by some local interactions between distant residues of the protein, such as disulfide bonds, electrostatic i...
EUROCRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...