Sciweavers

48 search results - page 6 / 10
» Precise Concurrent Zero Knowledge
Sort
View
IH
2001
Springer
13 years 12 months ago
Zero-Knowledge Watermark Detection and Proof of Ownership
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
André Adelsbach, Ahmad-Reza Sadeghi
ASIACRYPT
2004
Springer
14 years 24 days ago
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
COLING
1996
13 years 8 months ago
Anaphora Resolution of Japanese Zero Pronouns with Deictic Reference
This paper proposes a method to resolve the reference of deictic Japanese zero pronouns which can be implemented in a practical machine translation system. This method focuses on ...
Hiromi Nakaiwa, Satoshi Shirai
DSN
2009
IEEE
13 years 10 months ago
Precise request tracing and performance debugging for multi-tier services of black boxes
As more and more multi-tier services are developed from commercial components or heterogeneous middleware without the source code available, both developers and administrators nee...
Zhihong Zhang, Jianfeng Zhan, Yong Li, Lei Wang, D...
EUROCRYPT
2007
Springer
13 years 11 months ago
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
Yi Deng, Dongdai Lin