111 search results - page 6 / 23 » Characterization of Secure Multiparty Computation Without Br... |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
SRDS
2010
IEEE
14 years 7 months ago
2010
IEEE
Cloud computing allows the use of Internet-based services to support business processes and rental of IT-services on a utility-like basis. It offers a concentration of resources bu...
109
click to vote
IACR
2011
13 years 9 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...
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...