Sciweavers

2436 search results - page 288 / 488
» Comonadic Notions of Computation
Sort
View
IACR
2011
149views more  IACR 2011»
14 years 6 months ago
Public Key Encryption for the Forgetful
We investigate public key encryption that allows the originator of a ciphertext to retrieve a “forgotten” plaintext from the ciphertext. This type of public key encryption wit...
Puwen Wei, Yuliang Zheng, Xiaoyun Wang
WWW
2007
ACM
16 years 7 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
PKC
2009
Springer
166views Cryptology» more  PKC 2009»
16 years 7 months ago
Security of Blind Signatures under Aborts
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
Dominique Schröder, Marc Fischlin
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 6 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
ICSE
2003
IEEE-ACM
16 years 6 months ago
The Grand Challenge of Trusted Components
Reusable components equipped with strict guarantees of quality can help reestablish software development on a stronger footing, by taking advantage of the scaling effect of reuse ...
Bertrand Meyer