Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Baoshi Zhu

dblp:06/6316 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Digital forensics and information hiding · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Digital forensics and information hiding › content authentication
document authentication
0.122007
Render Sequence Encoding for Document Protection · IEEE Trans. Multim. 2007
Print signatures for document authentication · CCS 2003
Digital forensics and information hiding › watermarking
document watermarking
0.112007
Render Sequence Encoding for Document Protection · IEEE Trans. Multim. 2007
Mathematical optimization › combinatorial optimization › vehicle routing
traveling salesman problem
0.012007
Render Sequence Encoding for Document Protection · IEEE Trans. Multim. 2007

Methods — techniques the papers use, named apart from their topics

traveling salesman problem · 0.1render sequence encoding · 0.1security analysis · 0.0feature extraction · 0.0
YearPublicationVenuePosition
2007 Render Sequence Encoding for Document Protection
abstract
We present in this paper a novel electronic document watermarking method, render sequence encoding (RSE), and then further develop a RSE authentication method for electronic documents. RSE watermarks an electronic document by modulating the display sequences of words or characters. It features large information-carrying capacity and robustness over document format transcoding. The RSE authentication method is based on the NP-complete exact traveling salesman problem, which provides a rigorous foundation for security. The RSE authentication method is secure in the sense it is extremely difficult to forge the authentication process. RSE authentication process is also easy to operate, especially in comparison to digital signatures which requires public key infrastructure for its operation
Baoshi Zhu, Jian-Kang Wu, Mohan Kankanhalli
IEEE Trans. Multim.1
2003 Print signatures for document authentication
abstract
We present a novel solution for authenticating printed paper documents by utilizing the inherent non--repeatable randomness existing in the printing process. For a document printed by a laser-printer, we extract the unique features of the non--repeatable print content for each copy. The shape profiles of this content are used as the feature to represent the uniqueness of that particular printed copy. These features along with some important document content is then captured as the print signature. We present theoretical and experimental details on how to register as well as authenticate this print signature. The security analysis of this technique is also presented. We finally provide experimental results to demonstrate the feasibility of the proposed method.
Baoshi Zhu, Jian-Kang Wu, Mohan Kankanhalli
CCS1