CNF-FSS and its applications

DOI10.1007/978-3-030-97121-2_11zbMATH Open1492.94073OpenAlexW4214498702MaRDI QIDQ5087261FDOQ5087261

Authors: Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky 

Publication date: 8 July 2022

Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_11

Recommendations

• Function secret sharing
• Recent advances in function and homomorphic secret sharing (invited talk)
• Programmable distributed point functions
• Lightweight, maliciously secure verifiable function secret sharing
• Function secret sharing for mixed-mode and fixed-point secure computation

zbMATH Keywords

secret sharingfunction secret sharingreplicated secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Theory of Cryptography
• 3-query locally decodable codes of subexponential length
• General constructions for information-theoretic private information retrieval
• Universal service-providers for database private information retrieval (extended abstract)
• On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
• Title not available (Why is that?)
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Key Homomorphic PRFs and Their Applications
• Function Secret Sharing
• Secure Computation with Minimal Interaction, Revisited
• Title not available (Why is that?)
• Foundations of Homomorphic Secret Sharing
• Simple and efficient two-server ORAM
• Sub-logarithmic distributed oblivious RAM with small block size
• Distributed Oblivious RAM for Secure Two-Party Computation
• Distributed Point Functions and Their Applications
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Title not available (Why is that?)
• Two-server distributed ORAM with sublinear computation and constant rounds
• Efficient 3-party distributed ORAM
• Efficient pseudorandom correlation generators: silent OT extension and more

Cited In (5)

• Programmable distributed point functions
• Lightweight, maliciously secure verifiable function secret sharing
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• Compressing unit-vector correlations via sparse pseudorandom generators
• Explicit and nearly tight lower bound for 2-party perfectly secure FSS

This page was built for publication: CNF-FSS and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087261)