Sciweavers

522 search results - page 37 / 105
» What's a Typical Commit
Sort
View
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
HICSS
2003
IEEE
118views Biometrics» more  HICSS 2003»
14 years 2 months ago
Lessons Learned from Real DSL Experiments
Over the years, our group, led by Bob Balzer, designed and implemented three domain-specific languages for use by outside people in real situations. The first language described t...
David S. Wile
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
k-Implementation
This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party ...
Dov Monderer, Moshe Tennenholtz
ELPUB
2007
ACM
14 years 23 days ago
Openness in Higher Education: Open Source, Open Standards, Open Access
For national advisory services in the UK (UKOLN, CETIS, and OSS Watch), varieties of openness (open source software, open standards, and open access to research publications and d...
Brian Kelly, Scott Wilson, Randy Metcalfe
CCS
2006
ACM
14 years 18 days ago
Secure hierarchical in-network aggregation in sensor networks
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song