Sciweavers

80 search results - page 8 / 16
» General Secure Multi-party Computation from any Linear Secre...
Sort
View
TCS
2008
13 years 6 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 3 days ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
CCS
2010
ACM
13 years 7 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
FSE
2007
Springer
101views Cryptology» more  FSE 2007»
14 years 26 days ago
Generalized Correlation Analysis of Vectorial Boolean Functions
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan...
EUROCRYPT
2010
Springer
13 years 11 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...