Sciweavers

19 search results - page 1 / 4
» Universal forcing notions and ideals
Sort
View
AML
2007
42views more  AML 2007»
13 years 5 months ago
Universal forcing notions and ideals
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...
Andrzej Roslanowski, Saharon Shelah
MLQ
2006
77views more  MLQ 2006»
13 years 5 months ago
How much sweetness is there in the universe?
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...
Andrzej Roslanowski, Saharon Shelah
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 6 months ago
New notions of security: achieving universal composability without trusted setup
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...
Manoj Prabhakaran, Amit Sahai
JSYML
2011
89views more  JSYML 2011»
12 years 8 months ago
Forcing properties of ideals of closed sets
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...
Marcin Sabok, Jindrich Zapletal
TCC
2005
Springer
108views Cryptology» more  TCC 2005»
13 years 11 months ago
Comparing Two Notions of Simulatability
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...
Dennis Hofheinz, Dominique Unruh