570 search results - page 21 / 114 » Black-box constructions for secure computation |
ACISP
2006
Springer
13 years 11 months ago
2006
Springer
The only known construction of identity-based signatures that can be proven secure in the standard model is based on the approach of attaching certificates to non-identity-based si...
CANS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
ASIACRYPT
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
DIM
2009
ACM
14 years 2 months ago
2009
ACM
Reputation forms an important part of how we come to trust people in face-to-face interactions, and thus situations involving trust online have come to realize that reputation is ...