[go: up one dir, main page]

Wei et al., 2023 - Google Patents

Cryptographically secure private record linkage using locality-sensitive hashing

Wei et al., 2023

View PDF
Document ID
12983490993300843088
Author
Wei R
Kerschbaum F
Publication year
Publication venue
Proceedings of the VLDB Endowment

External Links

Snippet

Private record linkage (PRL) is the problem of identifying pairs of records that approximately match across datasets in a secure, privacy-preserving manner. Two-party PRL specifically allows each of the parties to obtain records from the other party, only given that each record …
Continue reading at www.vldb.org (PDF) (other versions)

Classifications

    • 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/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G06F21/6254—Protecting personal data, e.g. for financial or medical purposes by anonymising data, e.g. decorrelating personal data from the owner's identification
    • 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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30289—Database design, administration or maintenance
    • G06F17/30303—Improving data quality; Data cleansing
    • 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
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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
    • 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to 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
    • G06F11/00—Error detection; Error correction; Monitoring
    • 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/3247—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 involving digital signatures
    • 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage

Similar Documents

Publication Publication Date Title
He et al. Composing differential privacy and secure computation: A case study on scaling private record linkage
Roy Chowdhury et al. Cryptϵ: Crypto-assisted differential privacy on untrusted servers
Sun et al. Practical backward-secure searchable encryption from symmetric puncturable encryption
Ohrimenko et al. Oblivious {Multi-Party} machine learning on trusted processors
Rastegin Uncertainty relations for MUBs and SIC-POVMs in terms of generalized entropies
Murugesan et al. Efficient privacy-preserving similar document detection
Bian et al. HE3DB: An efficient and elastic encrypted database via arithmetic-and-logic fully homomorphic encryption
Wei et al. Cryptographically secure private record linkage using locality-sensitive hashing
Liu et al. SMC: A practical schema for privacy-preserved data sharing over distributed data streams
Esiner et al. Flexdpdp: Flexlist-based optimized dynamic provable data possession
Ni et al. A non-commuting stabilizer formalism
Bogdanov et al. On the security of Goldreich’s one-way function
Cai et al. Dichotomy for real Holant c problems
Vatsalan et al. Efficient two-party private blocking based on sorted nearest neighborhood clustering
Feng et al. Hamilton–Jacobi equations in space of measures associated with a system of conservation laws
Karakasidis et al. Scalable blocking for privacy preserving record linkage
Lin et al. The complexity of Boolean Holant problems with nonnegative weights
Kane Quantum money from modular forms
Wang et al. Flashproofs: Efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
Guo et al. Unifying presampling via concentration bounds
Fu et al. De-anonymization of social networks with communities: When quantifications meet algorithms
Luo et al. Secure sampling for approximate multi-party query processing
Köbler On graph isomorphism for restricted graph classes
Yakout et al. Efficient and practical approach for private record linkage
AT&T