Sciweavers

1195 search results - page 48 / 239
» New constructions of SSPDs and their applications
Sort
View
ASIACRYPT
2009
Springer
15 years 6 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
AML
2006
85views more  AML 2006»
14 years 12 months ago
Arithmetical Sacks Forcing
Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical ...
Rod Downey, Liang Yu
FM
1999
Springer
109views Formal Methods» more  FM 1999»
15 years 4 months ago
Compositional Symmetric Sharing in B
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
Martin Büchi, Ralph-Johan Back
UIST
1995
ACM
15 years 3 months ago
Social Activity Indicators: Interface Components for CSCW Systems
Knowing what social activity is occurring within and through a Computer-Supported Cooperative Work (CSCW) system is often very useful. This is especially true for computer-mediate...
Mark S. Ackerman, Brian Starr
ASIACRYPT
2011
Springer
13 years 12 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz