Sciweavers

Share
3 search results - page 1 / 1
» On Bitcoin Security in the Presence of Broken Crypto Primiti...
Sort
View
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
11 years 4 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
CSFW
2007
IEEE
11 years 6 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
EUROCRYPT
2007
Springer
11 years 6 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
books