Sciweavers

195 search results - page 3 / 39
» Hiding the complexity of LBS
Sort
View
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
14 years 1 months ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
Hoeteck Wee
CGO
2003
IEEE
14 years 28 days ago
Hiding Program Slices for Software Security
Given the high cost of producing software, development of technology for prevention of software piracy is important for the software industry. In this paper we present a novel app...
Xiangyu Zhang, Rajiv Gupta
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
13 years 11 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...
ICASSP
2008
IEEE
14 years 2 months ago
High rate data hiding in ACELP speech codecs
A new method for hiding digital data in the bitstream of an ACELP speech codec is proposed in this paper. The key element of our method is an alternative search strategy for the A...
Bernd Geiser, Peter Vary
CSCW
2004
ACM
14 years 1 months ago
Collaborative modeling: hiding UML and promoting data examples in NEMo
Domain experts are essential for successful software development, but these experts may not recognize their ideas when abstracted into Unified Modeling Language (UML) or ontologie...
Patricia K. Schank, Lawrence Hamel