Sciweavers

212 search results - page 11 / 43
» Universally Composable Commitments
Sort
View
IACR
2011
105views more  IACR 2011»
12 years 7 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi

Lab
1051views
12 years 8 months ago
Software Engineering Research Group (GIIS)
The Software Engineering Research Group (GIIS) of the University of Oviedo is composed by 9 researchers, headquartered at the University Campus of Gijón (Spain).
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
14 years 1 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
BNCOD
2006
69views Database» more  BNCOD 2006»
13 years 9 months ago
Reducing Sub-transaction Aborts and Blocking Time Within Atomic Commit Protocols
Composed Web service transactions executed in distributed networks often require an atomic execution. Guaranteeing atomicity in mobile networks involves a lot more challenges than ...
Stefan Böttcher, Le Gruenwald, Sebastian Ober...