scientific article; zbMATH DE number 2009950

zbMath1038.94544MaRDI QIDQ4434870

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

blind signaturestwo-party computationgradual release timed commitments

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (14)

Concurrent signatures from a variety of keys ⋮ Partial fairness in secure two-party computation ⋮ Breaking and fixing garbled circuits when a gate has duplicate input wires ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ 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 ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Legally Fair Contract Signing Without Keystones ⋮ How to obtain full privacy in auctions ⋮ On Complete Primitives for Fairness

This page was built for publication: