Theory of Cryptography

DOI10.1007/11681878zbMath1112.94011OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898366

Ke Yang, Juan A. Garay, Manoj Prabhakaran, Philip D. MacKenzie

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (15)

Toward a game theoretic view of secure computation ⋮ Concurrent signatures from a variety of keys ⋮ Security of blind signatures revisited ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Partial fairness in secure two-party computation ⋮ Completeness theorems for adaptively secure broadcast ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ An Efficient Protocol for Fair Secure Two-Party Computation ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Legally Fair Contract Signing Without Keystones ⋮ On Complete Primitives for Fairness

This page was built for publication: Theory of Cryptography