53 search results - page 6 / 11 » Minimal Complete Primitives for Secure Multi-party Computati... |
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
ICQNM
2008
IEEE
14 years 1 months ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
ICICS
2003
Springer
14 years 17 days ago
2003
Springer
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
MOBISYS
2009
ACM
14 years 8 months ago
2009
ACM
Establishing trust between a group of individuals remains a difficult problem. Prior works assume trusted infrastructure, require an individual to trust unknown entities, or provi...