Sciweavers

5476 search results - page 739 / 1096
» Resettably Secure Computation
Sort
View
SP
2008
IEEE
113views Security Privacy» more  SP 2008»
15 years 6 months ago
Inter-operating grids through Delegated MatchMaking
The grid vision of a single computing utility has yet to materialize: while many grids with thousands of processors each exist, most work in isolation. An important obstacle for t...
Alexandru Iosup, Todd Tannenbaum, Matthew Farrelle...
TCS
2008
15 years 6 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
CHI
2011
ACM
14 years 10 months ago
Oops, I did it again: mitigating repeated access control errors on facebook
We performed a study of Facebook users to examine how they coped with limitations of the Facebook privacy settings interface. Students graduating and joining the workforce create ...
Serge Egelman, Andrew Oates, Shriram Krishnamurthi
SIGMOD
2011
ACM
177views Database» more  SIGMOD 2011»
14 years 9 months ago
NetTrails: a declarative platform for maintaining and querying provenance in distributed systems
We demonstrate NetTrails, a declarative platform for maintaining and interactively querying network provenance in a distributed system. Network provenance describes the history an...
Wenchao Zhou, Qiong Fei, Shengzhi Sun, Tao Tao, An...
IACR
2011
152views more  IACR 2011»
14 years 6 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa