Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Publicly Auditable Secure Multi-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Multiparty Computation Goes Live / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Client Non-interactive Verifiable Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-input Functional Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Client Verifiable Computation with Stronger Security Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of Restricted Shuffles / rank
 
Normal rank

Latest revision as of 15:18, 12 July 2024

scientific article
Language Label Description Also known as
English
Verifiable Multi-party Computation with Perfectly Private Audit Trail
scientific article

    Statements

    Identifiers