-
[1]
- J. H. An, Y. Dodis, and T. Rabin. On the security of
joint signature and encryption. In Advances in Cryptology
— EUROCRYPT 2002, volume 2332 of LNCS, pages 83–107.
Springer, 2002. https://eprint.iacr.org/2002/046
-
[2]
- M. Bellare. Practice-oriented provable-security. In Proceedings
of the First International Workshop on Information Security (ISW
’97), volume 1396 of LNCS, pages 221–231. Springer, 1998.
https://cseweb.ucsd.edu/~mihir/papers/isw-pops.pdf
-
[3]
- C. Badertscher, U. Maurer, D. Tschudi, and V. Zikas. Bitcoin
as a transaction ledger: A composable treatment. In Advances
in Cryptology — CRYPTO 2017, volume 10401 of LNCS, pages
324–356. Springer, 2017. https://eprint.iacr.org/2017/149
-
[4]
- A. Bauer and M. Pretnar. Programming with algebraic effects
and
handlers. Journal of Logical and Algebraic Methods in Programming,
84(1):108–123, 2015. https://arxiv.org/abs/1203.1539
-
[5]
- M. Bellare and P. Rogaway. The security of triple encryption and
a framework for code-based game-playing proofs. In Advances
in Cryptology — EUROCRYPT 2006, volume 4004 of LNCS, pages
409–426. Springer, 2006. https://eprint.iacr.org/2004/331
-
[6]
- R. Canetti. Universally composable signature, certification, and
authentication. In 17th IEEE Computer
Security Foundations Workshop (CSFW 2004), pages 219–233. IEEE,
2004. https://eprint.iacr.org/2003/239
-
[7]
- R. Canetti. Universally composable security. Journal of the ACM,
67(5):28:1–28:94, 2020. https://eprint.iacr.org/2000/067
-
[8]
- R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally
composable security with global setup. In Theory of Cryptography
— TCC 2007, volume 4392 of LNCS, pages 61–85. Springer, 2007.
https://eprint.iacr.org/2006/432
-
[9]
- P. Farshim, M. Karvonen,
A. Knispel, M. Kohlweiss, and P. Wadler. UC, categorically:
Rigorous diagrammatic proofs. arXiv preprint arXiv:2608.04521,
2026. https://arxiv.org/abs/2608.04521
-
[10]
- S. Goldwasser, S. Micali, and R. Rivest. A digital
signature scheme secure against adaptive chosen-message
attacks. SIAM Journal on Computing, 17(2):281–308, 1988.
https://people.csail.mit.edu/silvio/Selected\%20Scientific\%20Papers/Digital\%20Signatures/A_Digital_Signature_Scheme_Secure_Against_Adaptive_Chosen-Message_Attack.pdf
-
[11]
- J. Katz, U. Maurer, B. Tackmann, and V. Zikas. Universally
composable synchronous computation. In Theory of Cryptography
— TCC 2013, volume 7785 of LNCS, pages 477–498. Springer,
2013. https://eprint.iacr.org/2011/310
-
[12]
- G. Plotkin and M. Pretnar. Handlers of algebraic effects.
In 18th European Symposium on Programming (ESOP 2009),
volume 5502 of LNCS, pages 80–94. Springer, 2009.
https://homepages.inf.ed.ac.uk/gdp/publications/Effect_Handlers.pdf
-
[13]
- V. Shoup. Sequences of games: A tool for taming complexity in
security proofs. IACR Cryptology ePrint Archive, Report 2004/332,
2004. https://eprint.iacr.org/2004/332