570 search results - page 76 / 114 » Black-box constructions for secure computation |
PODC
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
CCS
2009
ACM
14 years 8 months ago
2009
ACM
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
CIS
2005
Springer
14 years 1 months ago
2005
Springer
Restrictive blind signatures allow a recipient to receive a blind signature on a message not known to the signer but the choice of message is restricted and must conform to certain...
EUROCRYPT
1999
Springer
14 years 7 days ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...