Cutting-edge cryptography through the lens of secret sharing
From MaRDI portal
Publication:1627968
DOI10.1016/j.ic.2018.09.011zbMath1429.94061OpenAlexW3124112194MaRDI QIDQ1627968
Ilan Komargodski, Mark Zhandry
Publication date: 3 December 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2018.09.011
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Be adaptive, avoid overcommitting
- Secret-sharing for NP
- How to Avoid Obfuscation Using Witness PRFs
- Cutting-Edge Cryptography Through the Lens of Secret Sharing
- How to share a function securely
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Function Secret Sharing
- How to Obfuscate Programs Directly
- Functional Encryption: Definitions and Challenges
- Secret-Sharing Schemes: A Survey
- How to share a secret
- New Multilinear Maps Over the Integers
- A Pseudorandom Generator from any One-way Function
- Computing Functions of a Shared Secret
- Candidate Multilinear Maps from Ideal Lattices
- How to use indistinguishability obfuscation
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- On the (im)possibility of obfuscating programs
- Functional Signatures and Pseudorandom Functions
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- Witness encryption and its applications
- Secure Multiparty Computation and Secret Sharing
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Cutting-edge cryptography through the lens of secret sharing
