Foundations of Homomorphic Secret Sharing (Q4993284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Foundations of Homomorphic Secret Sharing
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography in $NC^0$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally private randomizing polynomials and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity of Simultaneous Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case fine-grained hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(d\)-multiplicative secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spooky Encryption and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Server PIR with Sub-Polynomial Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic secret sharing from Paillier encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Secure MPC from Indistinguishability Obfuscation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Point Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for linear locally decodable codes and private information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round MPC with Fairness and Guarantee of Output Delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of local decoding procedures for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized one-round communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Round Multiparty Computation via Multi-key FHE / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549622 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8365/pdf/LIPIcs-ITCS-2018-21.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2783978526 / rank
 
Normal rank
Property / title
 
Foundations of Homomorphic Secret Sharing (English)
Property / title: Foundations of Homomorphic Secret Sharing (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 30 July 2024

scientific article; zbMATH DE number 7359358
Language Label Description Also known as
English
Foundations of Homomorphic Secret Sharing
scientific article; zbMATH DE number 7359358

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2021
    0 references
    cryptography
    0 references
    homomorphic secret sharing
    0 references
    secure computation
    0 references
    communication complexity
    0 references
    worst-case to average-case reductions.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Foundations of Homomorphic Secret Sharing (English)
    0 references

    Identifiers