Credibility in private set membership

DOI10.1007/978-3-031-31371-4_6zbMath1526.94049OpenAlexW4367593108MaRDI QIDQ6067357

Sina Shiehian, Zhengzhong Jin, Omkant Pandey, Abhishek Jain, Sanjam Garg, Mohammad Hajiabadi

Publication date: 16 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_6

zbMATH Keywords

communication complexityfully homomorphic encryption

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Amortizing rate-1 OT and applications to PIR and PSI
• New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
• Maliciously Circuit-Private FHE
• On the Communication Complexity of Secure Function Evaluation with Long Output
• Private information retrieval
• Evaluating Branching Programs on Encrypted Data
• A Framework for Efficient and Composable Oblivious Transfer
• MyOPE: malicious security for oblivious polynomial evaluation
• Unnamed Item

This page was built for publication: Credibility in private set membership