CNF-FSS and its applications

DOI10.1007/978-3-030-97121-2_11MaRDI QIDQ5087261zbMATHOpenAlexFDO

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

zbMATH Keywords

secret sharingfunction secret sharingreplicated secret sharing

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 1952886 (Why is no real title available?)
• scientific article; zbMATH DE number 1559545 (Why is no real title available?)
• scientific article; zbMATH DE number 1418319 (Why is no real title available?)
• 3-query locally decodable codes of subexponential length
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Breaking the circuit size barrier for secure computation under DDH
• Distributed Oblivious RAM for Secure Two-Party Computation
• Distributed Point Functions and Their Applications
• Efficient 3-party distributed ORAM
• Efficient pseudorandom correlation generators: silent OT extension and more
• Foundations of homomorphic secret sharing
• Function secret sharing
• General constructions for information-theoretic private information retrieval
• High-throughput secure three-party computation for malicious adversaries and an honest majority
• Key homomorphic PRFs and their applications
• On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
• Secure computation with minimal interaction, revisited
• Simple and efficient two-server ORAM
• Spooky Encryption and Its Applications
• Sub-logarithmic distributed oblivious RAM with small block size
• Theory of Cryptography
• Two-server distributed ORAM with sublinear computation and constant rounds
• Universal service-providers for database private information retrieval (extended abstract)

Cited in

(8)

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

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)