64 search results - page 1 / 13 » TASTY: tool for automating secure two-party computations |
CCS
2010
ACM
13 years 5 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
IACR
2011
12 years 4 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
CCS
2000
ACM
13 years 8 months ago
2000
ACM
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
ESOP
2005
Springer
13 years 10 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...