Sciweavers

Share
15 search results - page 3 / 3
» Better Preprocessing for Secure Multiparty Computation
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
11 years 6 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
ESORICS
2010
Springer
11 years 2 months ago
Optimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...
Alptekin Küpçü, Anna Lysyanskaya
CNIS
2006
11 years 2 months ago
An efficient hybrid algorithm for multidimensional packet classification
Multidimensional Packet Classification is one of the most critical functions for network security devices such as firewalls and intrusion detection systems. Due to the worst case ...
Yaxuan Qi, Jun Li
EUROCRYPT
2005
Springer
11 years 7 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
CCS
2009
ACM
11 years 8 months ago
Dynamic provable data possession
As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has receiv...
C. Christopher Erway, Alptekin Küpç&uu...
books