Algorithms
Efficient detection of corrupted pages in a replicated file
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
A new parallel signature file method for efficient information retrieval
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Recursive hashing functions for n-grams
ACM Transactions on Information Systems (TOIS)
Computer security
Compressed multi-framed signature files: an index structure for fast information retrieval
Proceedings of the 1999 ACM symposium on Applied computing
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Databases and transaction processing: an application-oriented approach
ACM SIGMOD Record
Compactly encoding unstructured inputs with differential compression
Journal of the ACM (JACM)
A Class of Randomized Strategies for Low-Cost Comparison of File Copies
IEEE Transactions on Parallel and Distributed Systems
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Reliability Mechanisms for Very Large Storage Systems
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
A Parity Structure for Large Remotely Located Replicated Data Files
IEEE Transactions on Computers
Network security: private communication in a public world, second edition
Network security: private communication in a public world, second edition
Fast nGram-based string search over data encoded using algebraic signatures
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Adding aggressive error correction to a high-performance compressing flash file system
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
AS-index: a structure for string search using n-grams and algebraic signatures
Proceedings of the 18th ACM conference on Information and knowledge management
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Performance improvement of join queries through algebraic signatures
International Journal of Intelligent Information and Database Systems
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
ACM Transactions on Sensor Networks (TOSN)
Using algebraic signatures to check data possession in cloud storage
Future Generation Computer Systems
| Hi-index | 0.00 |
Signatures detect changes to data objects.Numerous schemes are in use, especially thecryptographically secure standards SHA-1. Wepropose a novel signature scheme which we callalgebraic signatures. The scheme uses the Galois Fieldcalculations. Its major property is the sure detection ofany changes up to a parameterized size. Moreprecisely, we detect for sure any changes that do notexceed n-symbols for an n-symbol algebraic signature.This property is new for any known signature scheme.For larger changes, the collision probability istypically negligible, as for the other known schemes.We apply the algebraic signatures to the ScalableDistributed Data Structures (SDDS). We filter at theSDDS client node the updates that do not actuallychange the records. We also manage the concurrentupdates to data stored in the SDDS RAM buckets at theserver nodes. We further use the scheme for the fastdisk backup of these buckets. We sign our objects with4-byte signatures, instead of 20-byte standard SHA-1signatures. Our algebraic calculus is then also abouttwice as fast.