Theory of Cryptography
From MaRDI portal
Publication:5898366
DOI10.1007/11681878zbMATH Open1112.94011OpenAlexW3149533473MaRDI QIDQ5898366FDOQ5898366
Philip MacKenzie, Ke Yang, Juan Garay, Manoj Prabhakaran
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
Cited In (18)
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Time-release cryptography from minimal circuit assumptions
- Formal Abstractions for Attested Execution Secure Processors
- Security of blind signatures revisited
- On Complete Primitives for Fairness
- Concurrent signatures from a variety of keys
- Completeness theorems for adaptively secure broadcast
- Partial fairness in secure two-party computation
- An Efficient Protocol for Fair Secure Two-Party Computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Toward a game theoretic view of secure computation
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Complete characterization of fairness in secure two-party computation of Boolean functions
- TARDIS: a foundation of time-lock puzzles in UC
- Legally Fair Contract Signing Without Keystones
- On sequential functions and fine-grained cryptography
- Resource fairness and composability of cryptographic protocols
- Efficient Binary Conversion for Paillier Encrypted Values
Recommendations
- Resource fairness and composability of cryptographic protocols 👍 👎
- How fair is your protocol? A utility-based approach to protocol optimality 👍 👎
- Complete Fairness in Multi-party Computation without an Honest Majority 👍 👎
- Partial fairness in secure two-party computation 👍 👎
- Complete Fairness in Secure Two-Party Computation 👍 👎
This page was built for publication: Theory of Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898366)
