Sciweavers

4690 search results - page 372 / 938
» An operational semantics for Scheme
Sort
View
170
Voted
EUROCRYPT
1999
Springer
15 years 11 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold
EUROCRYPT
2006
Springer
15 years 10 months ago
A Provable-Security Treatment of the Key-Wrap Problem
Abstract. We give a provable-security treatment for the key-wrap problem, providing definitions, constructions, and proofs. We suggest that key-wrap's goal is security in the ...
Phillip Rogaway, Thomas Shrimpton
179
Voted
PDCN
2004
15 years 8 months ago
Implementing a secure setuid program
Setuid programs are often exploited by malicious attackers to obtain unauthorized access to local systems. Setuid programs, especially owned by the root user, are granted root pri...
Takahiro Shinagawa, Kenji Kono
203
Voted
SOSP
1989
ACM
15 years 8 months ago
Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors
Shared-memory multiprocessors are frequently used in a timesharing style with multiple parallel applications executing at the same time. In such an environment, where the machine ...
Andrew Tucker, Anoop Gupta
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 7 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro