Cutting-Edge Cryptography Through the Lens of Secret Sharing
From MaRDI portal
Publication:2799105
DOI10.1007/978-3-662-49099-0_17zbMath1382.94131OpenAlexW2293995972MaRDI QIDQ2799105
Ilan Komargodski, Mark Zhandry
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_17
Related Items (4)
Cutting-edge cryptography through the lens of secret sharing ⋮ Secret-sharing for NP ⋮ Robust Distributed Pseudorandom Functions for mNP Access Structures ⋮ How to Avoid Obfuscation Using Witness PRFs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- How to Avoid Obfuscation Using Witness PRFs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- 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
- Secret-Sharing for NP
- Function Secret Sharing
- 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
- Obfuscating Circuits via Composite-Order Graded Encoding
- Protecting Obfuscation against Algebraic Attacks
- Multi-input Functional Encryption
- Witness encryption and its applications
- 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
