scientific article; zbMATH DE number 2009950
From MaRDI portal
Publication:4434870
zbMATH Open1038.94544MaRDI QIDQ4434870FDOQ4434870
Authors: Benny Pinkas 
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560087.htm
Title of this publication is not available (Why is that?)
Recommendations
Cited In (22)
- On complete primitives for fairness
- Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Title not available (Why is that?)
- Synchronizable fair exchange
- Covert two-party computation
- Secure two-party computation with fairness -- a necessary design principle
- Breaking and fixing garbled circuits when a gate has duplicate input wires
- Concurrent signatures from a variety of keys
- Partial fairness in secure two-party computation
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- An Efficient Protocol for Fair Secure Two-Party Computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Legally Fair Contract Signing Without Keystones
- Title not available (Why is that?)
- Resource fairness and composability of cryptographic protocols
- Efficiently making secure two-party computation fair
- How to obtain full privacy in auctions
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434870)
