[go: up one dir, main page]

De Bonis et al., 2011 - Google Patents

Combinatorial group testing for corruption localizing hashing

De Bonis et al., 2011

Document ID
10216282468947738984
Author
De Bonis A
Di Crescenzo G
Publication year
Publication venue
Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings 17

External Links

Snippet

Corruption-localizing hashing is a recently introduced cryptographic primitive that enhances the well-known primitive of collision-intractable hashing. In addition to allowing detection of changes in input data, they also provide a superset of the changes location, where the …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems

Similar Documents

Publication Publication Date Title
Lokshtanov et al. Beating brute force for systems of polynomial equations over finite fields
Boyar et al. Logic minimization techniques with applications to cryptology
Hagerup et al. Deterministic dictionaries
Elkin A faster distributed protocol for constructing a minimum spanning tree
US8607057B2 (en) Secure outsourced aggregation with one-way chains
Ben-Asher et al. Optimal search in trees
Ben-Sasson et al. Worst-case to average case reductions for the distance to a code
Grassi et al. Quantum Algorithms for the-xor Problem
Birnbaum et al. An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
Joglekar et al. It’s all a matter of degree: Using degree information to optimize multiway joins
Blanchet CryptoVerif: A computationally-sound security protocol verifier
Butti et al. Fractional homomorphism, Weisfeiler-Leman invariance, and the Sherali-Adams hierarchy for the constraint satisfaction problem
Holmgren et al. Faster sounder succinct arguments and iop s
De Bonis et al. Combinatorial group testing for corruption localizing hashing
Pettie et al. Optimal vertex connectivity oracles
Parter et al. Connectivity labeling and routing with multiple vertex failures
Narayanan et al. Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
Ben-Aroya et al. Local list decoding with a constant number of queries
Köbler On graph isomorphism for restricted graph classes
Arnon et al. Whir: Reed–solomon proximity testing with super-fast verification
Chen et al. On the dag decomposition
Gao et al. Holistic top-k simple shortest path join in graphs
Jho et al. Symmetric searchable encryption with efficient conjunctive keyword search
Saha et al. An automated framework for exploitable fault identification in block ciphers
Patel et al. Efficient secret sharing for large-scale applications