Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
In one proposed use of digital watermarks, the owner of a document D sells slightly different documents, D1 , D2 , . . . to each buyer; if a buyer posts his/her document Di to the...
Current geographic information systems (GISs) have been designed for querying and maintaining static databases representing static phenomena and give little support to those users ...