The following pages link to Theory of Cryptography (Q5898366):
Displaying 17 items.
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Concurrent signatures from a variety of keys (Q2151283) (← links)
- Security of blind signatures revisited (Q2397446) (← links)
- Legally Fair Contract Signing Without Keystones (Q2822672) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Fair Threshold Decryption with Semi-Trusted Third Parties (Q3634502) (← links)
- An Efficient Protocol for Fair Secure Two-Party Computation (Q5458934) (← links)
- Legally-Enforceable Fairness in Secure Two-Party Computation (Q5458936) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
