Sciweavers

3147 search results - page 23 / 630
» Statistically Hiding Sets
Sort
View
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 8 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
NLDB
2004
Springer
14 years 28 days ago
Synonymous Paraphrasing Using WordNet and Internet
We propose a method of synonymous paraphrasing of a text based on WordNet synonymy data and Internet statistics of stable word combinations (collocations). Given a text, we look fo...
Igor A. Bolshakov, Alexander F. Gelbukh
IH
1998
Springer
13 years 11 months ago
An Information-Theoretic Model for Steganography
An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi e...
Christian Cachin
PSD
2004
Springer
186views Database» more  PSD 2004»
14 years 27 days ago
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type
In an on-line statistical database, the query-answering system should prevent answers to statistical queries from leading to disclosure of confidential data. On the other hand, a s...
Francesco M. Malvestuto, Mauro Mezzini