Sciweavers

5722 search results - page 806 / 1145
» Security Function Interactions
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 11 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
SDMW
2009
Springer
15 years 10 months ago
Longitude: Centralized Privacy-Preserving Computation of Users' Proximity
A “friend finder” is a Location Based Service (LBS) that informs users about the presence of participants in a geographical area. In particular, one of the functionalities of ...
Sergio Mascetti, Claudio Bettini, Dario Freni
AGENTS
2001
Springer
15 years 10 months ago
The intelligent classroom: providing competent assistance
In the software industry, designers are forever trying to “improve” their products by adding ever more features to them, producing bloated software systems that are capable of...
David Franklin, Kristian J. Hammond
AGENTS
2001
Springer
15 years 10 months ago
Matchmaking for autonomous agents in electronic marketplaces
Matchmaking is the process of mediating demand and supply based on profile information. Matchmaking plays a crucial role in agent-based electronic marketplaces: the problem to be ...
Daniel Veit, Jörg P. Müller, Martin Schn...
ASPLOS
2000
ACM
15 years 10 months ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin