Sciweavers

139 search results - page 25 / 28
» Identity-based Threshold Signature Secure in the Standard Mo...
Sort
View
CSFW
2011
IEEE
12 years 8 months ago
Dynamic Enforcement of Knowledge-Based Security Policies
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...
Piotr Mardziel, Stephen Magill, Michael Hicks, Mud...
BMCBI
2008
109views more  BMCBI 2008»
13 years 8 months ago
MetaFIND: A feature analysis tool for metabolomics data
Background: Metabolomics, or metabonomics, refers to the quantitative analysis of all metabolites present within a biological sample and is generally carried out using NMR spectro...
Kenneth Bryan, Lorraine Brennan, Padraig Cunningha...
SPW
2004
Springer
14 years 1 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson
ASIACRYPT
2008
Springer
13 years 10 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
14 years 2 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...