Sciweavers

570 search results - page 63 / 114
» Black-box constructions for secure computation
Sort
View
DCC
2006
IEEE
14 years 7 months ago
A Fuzzy Vault Scheme
We describe a simple and novel cryptographic construction that we refer to as a fuzzy vault. A player Alice may place a secret value in a fuzzy vault and "lock" it using ...
Ari Juels, Madhu Sudan
IEEEARES
2008
IEEE
14 years 2 months ago
Assessing the Reliability and Cost of Web and Grid Orchestrations
Unreliability is a characteristic feature of web and grid based computation: a call to a web or grid site may or may not succeed. An orchestration manager aims to control web or g...
Alan Stewart, Maurice Clint, Terry Harmer, Peter K...
IJNSEC
2006
112views more  IJNSEC 2006»
13 years 8 months ago
An Access Control System with Time-constraint Using Support Vector Machines
Access control is an important issue in information security. It is a necessary mechanism for protecting data in a computer system. In this paper, we apply support vector machines...
Chin-Chen Chang, Iuon-Chang Lin, Chia-Te Liao
ICFP
2008
ACM
14 years 8 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs