The main result of this paper is a partial answer to [7, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determ...
Abstract. We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topolog...
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...