Succinct computational secret sharing (Q6499321)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7844693

Language	Label	Description	Also known as
English	Succinct computational secret sharing	scientific article; zbMATH DE number 7844693

Statements

scholarly article

0 references

Succinct computational secret sharing (English)

0 references

Benny Applebaum

0 references

0 references

0 references

Eyal Kushilevitz

0 references

0 references

Vinod Vaikuntanathan

0 references

publication date

8 May 2024

0 references

zbMATH Keywords

pseudorandom generators

0 references

secret sharing

0 references

MaRDI profile type

MaRDI publication profile

0 references

Distributed (correlation) samplers: how to remove a trusted dealer in one round

0 references

0 references

Secret-sharing schemes for general and uniform access structures

0 references

Better secret sharing via robust conditional disclosure of secrets

0 references

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys

0 references

Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)

0 references

Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More

0 references

Superpolynomial lower bounds for monotone span programs

0 references

The share size of secret-sharing schemes for almost all access structures and graphs

0 references

Secret-sharing schemes for very dense graphs

0 references

On the Power of Nonlinear Secret-Sharing

0 references

On the Cryptographic Complexity of the Worst Functions

0 references

0 references

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

0 references

Tight bounds on the information rate of secret sharing schemes

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys

0 references

Efficient pseudorandom correlation generators: silent OT extension and more

0 references

On the classification of ideal secret sharing schemes

0 references

Some improved bounds on the information rate of perfect secret sharing schemes

0 references

On-line secret sharing

0 references

On the size of shares for secret sharing schemes

0 references

Laconic oblivious transfer and its applications

0 references

0 references

The size of a share must be large

0 references

Secret sharing schemes on graphs

0 references

An impossibility result on graph secret sharing

0 references

Secret sharing on the \(d\)-dimensional cube

0 references

Optimal Information Rate of Secret Sharing Schemes on Trees

0 references

Trapdoor hash functions and their applications

0 references

Covering a graph by complete bipartite graphs

0 references

Improving the linear programming technique in the search for lower bounds in secret sharing

0 references

0 references

Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge

0 references

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption

0 references

Protecting data privacy in private information retrieval schemes

0 references

Foundations of Cryptography

0 references

On the Cryptographic Applications of Random Functions (Extended Abstract)

0 references

Secure Multiparty Computation with General Interaction Patterns

0 references

A Pseudorandom Generator from any One-way Function

0 references

On the Communication Complexity of Secure Function Evaluation with Long Output

0 references

Public-Coin Differing-Inputs Obfuscation and Its Applications

0 references

Partial Garbling Schemes and Their Applications

0 references

Multiple assignment scheme for sharing secret

0 references

Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)

0 references

On secret sharing systems

0 references

Secret-sharing for NP

0 references

Indistinguishability Obfuscation for Turing Machines with Unbounded Memory

0 references

0 references

Secret sharing lower bound: either reconstruction is hard or shares are long

0 references

Breaking the circuit-size barrier in secret sharing

0 references

Conditional disclosure of secrets via non-linear reconstruction

0 references

Towards breaking the exponential barrier for general secret sharing

0 references

0 references

Strongly exponential lower bounds for monotone computation

0 references

How to share a secret

0 references

Secret sharing schemes for graph-based prohibited structures

0 references

Progress in Cryptology - INDOCRYPT 2003

0 references

Secret Sharing and Statistical Zero Knowledge

0 references

On the information rate of perfect secret sharing schemes

0 references

Dual System Encryption via Predicate Encodings

0 references

Identifiers

10.1145/3564246.3585127

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6499321

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6499321&oldid=38018426"