Learn More
The extensible markup language (XML) is a promising standard for describing semi-structured information and contents on the Internet. When XML comes to be a widespread data encoding format for Web applications, safeguarding the accuracy of the information represented in XML documents will be indispensable. In this paper, we propose a provisional(More)
Enterprises collect large amounts of personal data from their customers. To ease privacy concerns, enterprises publish privacy statements that outline how data is used and shared. The Platform for Enterprise Privacy Practices (E-P3P) defines a fine-grained privacy policy model. A Chief Privacy Officer can use E-P3P to formalize the desired(More)
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access-control policies. However such access-control policies are burdens to the query engines for XML documents. To relieve this burden, we introduce static analysis for XML access-control. Given an access-control policy, query expression,(More)
  • Steve Anderson, Jeff Bohren, Opennetwork Toufic Boubez, Layer, Marc Chanliau, Giovanni Della-Libera +29 others
  • 2004
Permission to copy and display the WS-SecureConversation Specification (the " Specification " , which includes WSDL and schema documents), in any medium without fee or royalty is hereby granted, provided that you include the following on ALL copies of the Specification, that you make: 1. A link or URL to the Specification at one of the Authors' websites
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not there exists a protocol which achieves AIZK, but not BSZK. We show that the existence of such a protocol is closely related to the existence of secure code obfus-cators. A code(More)
Obfuscation is one of the most intriguing open problems in cryptography and only a few positive results are known. In TCC'07, Ho-henberger et al. proposed an obfuscator for a re-encryption functionality, which takes a ciphertext for a message encrypted under Alice's public key and transforms it into a ciphertext for the same message under Bob's public key(More)
The notion of correlation intractability was introduced in an attempt to capture the " un-predictability " property of random oracles: It is assumed that if R is a random oracle then it is infeasible to find an input x such that the input-output pair (x, R(x)) has some desired property. It is desirable that a plausible construction of correlation(More)