Sciweavers

456 search results - page 67 / 92
» Rethinking Digital Signatures
Sort
View
SSR
1997
93views more  SSR 1997»
13 years 9 months ago
Using Content-Derived Names for Configuration Management
Configuration management of compiled software artifacts (programs, libraries, icons, etc.) is a growing problem as software reuse becomes more prevalent. For an application compos...
Jeffrey K. Hollingsworth, Ethan L. Miller
ECCC
2010
78views more  ECCC 2010»
13 years 7 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
IJMSO
2006
105views more  IJMSO 2006»
13 years 7 months ago
Trust network-based filtering of aggregated claims
: On the semantic web, assertions may be aggregated from many sources, those aggregations filtered, reasoned over, aggregated with other aggregators, displayed, scraped, extracted,...
Jennifer Golbeck, Bijan Parsia
JSS
2008
97views more  JSS 2008»
13 years 7 months ago
XML security - A comparative literature review
Since the turn of the millenium, Working Groups of the W3C have been concentrating on the development of XML based security standards, which are paraphrased as XML Security. XML S...
Andreas Ekelhart, Stefan Fenz, Gernot Goluch, Mark...
ECCC
2007
185views more  ECCC 2007»
13 years 7 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan