Secure computation with low communication from cross-checking (Q1710664): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794855042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-homomorphic Encryption and Multiparty Computation / 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: Efficient Three-Party Computation from Cut-and-Choose / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Multiparty Protocols via Log-Depth Threshold Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Multiparty Computation: Theory and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Secure Multiparty Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Multiparty Computation with Nearly Optimal Work and Resilience / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Yet another compiler for active security or: efficient MPC over arbitrary rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Computation from Somewhat Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits resilient to additive attacks with applications to secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multi-party computation without agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Constant Round Multi-party Computation Combining BMR and SPDZ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Practical Active-Secure Two-Party Computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:52, 17 July 2024

scientific article
Language Label Description Also known as
English
Secure computation with low communication from cross-checking
scientific article

    Statements

    Secure computation with low communication from cross-checking (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2019
    0 references
    0 references

    Identifiers