Sciweavers

1991 search results - page 289 / 399
» Small Models of Large Machines
Sort
View
EUROCRYPT
2007
Springer
15 years 4 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
DAGSTUHL
2007
14 years 11 months ago
Note on parallel universes
The parallel universes idea is an attempt to integrate several aspects of learning which share some common aspects. This is an interesting idea: if successful, insights could cross...
Niall M. Adams, David J. Hand
WSC
1997
14 years 11 months ago
Sea Based Logistics: Distribution Problems for Future Global Contingencies
Evolving doctrine in the U. S. Marine Corps emphasizes small, highly-mobile forces, supported from the sea rather than from large, land-based supply points. We introduce some emer...
Keebom Kang, Kevin R. Gue
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
14 years 7 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
15 years 3 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...