Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Checking approximate computations over the reals
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Software forensics: can we track code to its authors?
Computers and Security
The design and implementation of tripwire: a file system integrity checker
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Designing programs that check their work
Journal of the ACM (JACM)
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Analysis of watermarking techniques for graph coloring problem
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Software watermarking: models and dynamic embeddings
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking the convexity of polytopes and the planarity of subdivision
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Checking geometric programs or verification of geometric structures
Selected papers from the 12th annual symposium on Computational Geometry
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Secure audit logs to support computer forensics
ACM Transactions on Information and System Security (TISSEC)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Watermarking maps: hiding information in structured data
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Practical network support for IP traceback
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Flexible authentication of XML documents
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Efficient packet marking for large-scale IP traceback
Proceedings of the 9th ACM conference on Computer and communications security
Eliminating counterevidence with applications to accountable certificate management
Journal of Computer Security
Mining e-mail content for author identification forensics
ACM SIGMOD Record
Certification of Computational Results
IEEE Transactions on Computers
A Simpler Minimum Spanning Tree Verification Algorithm
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Upward Planarity Checking: ``Faces Are More than Polygons''
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Graph Theoretic Approach to Software Watermarking
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Dynamic Self-Checking Techniques for Improved Tamper Resistance
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Protecting Software Code by Guards
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient and Fresh Cerification
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Authenticating distributed data using Web services and XML signatures
Proceedings of the 2002 ACM workshop on XML security
Query-preserving watermarking of relational databases and XML documents
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rights protection for relational data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Authentic data publication over the internet
Journal of Computer Security - IFIP 2000
List decoding of error-correcting codes
List decoding of error-correcting codes
A General Model for Authenticated Data Structures
Algorithmica
Secure Visualization of Authentication Information: A Case Study
VLHCC '04 Proceedings of the 2004 IEEE Symposium on Visual Languages - Human Centric Computing
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Watermarking relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Authenticated dictionaries for fresh attribute credentials
iTrust'03 Proceedings of the 1st international conference on Trust management
Authenticated data structures for graph and geometric searching
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Computational bounds on hierarchical data processing with applications to information security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Threats to privacy in the forensic analysis of database systems
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Private combinatorial group testing
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Forensic analysis of database tampering
ACM Transactions on Database Systems (TODS)
A tree-covering problem arising in integrity of tree-structured data
Information Processing Letters
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficiently decodable error-correcting list disjunct matrices and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Combinatorial group testing for corruption localizing hashing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Watermarking essential data structures for copyright protection
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Data forensics constructions from cryptographic hashing and coding
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
A variant of non-adaptive group testing and its application in pay-television via internet
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Combinatorial pair testing: distinguishing workers from slackers
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values specifically identified. We give forensic constructions for several fundamental data structures, including arrays, linked lists, binary search trees, skip lists, and hash tables. Some of our constructions are based on a new reduced-randomness construction for nonadaptive combinatorial group testing.