Theory of Cryptography
From MaRDI portal
(Redirected from Publication:5898366)
Theory of Cryptography (scientific article; zbMATH DE number 5124122)
Theory of Cryptography (scientific article; zbMATH DE number 5124122)
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
Cited in
(21)- On complete primitives for fairness
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Time-release cryptography from minimal circuit assumptions
- Security of blind signatures revisited
- Concurrent signatures from a variety of keys
- Partial fairness in secure two-party computation
- Completeness theorems for adaptively secure broadcast
- Toward a game theoretic view of secure computation
- An Efficient Protocol for Fair Secure Two-Party Computation
- Legally-Enforceable Fairness in Secure Two-Party 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
- Formal abstractions for attested execution secure processors
- Legally Fair Contract Signing Without Keystones
- How to use bitcoin to design fair protocols
- On sequential functions and fine-grained cryptography
- On concrete security treatment of signatures based on multiple discrete logarithms
- Resource fairness and composability of cryptographic protocols
- Efficient Binary Conversion for Paillier Encrypted Values
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)