Sciweavers

1018 search results - page 67 / 204
» Generative unbinding of names
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
14 years 25 days 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
USS
2008
13 years 11 months ago
Experiences with Model Inference Assisted Fuzzing
In this paper we introduce the idea of model inference assisted fuzzing aimed to cost effectively improve software security. We experimented with several model inference technique...
Joachim Viide, Aki Helin, Marko Laakso, Pekka Piet...
EWCBR
2008
Springer
13 years 11 months ago
Noticeably New: Case Reuse in Originality-Driven Tasks
"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original so...
Belén Díaz-Agudo, Enric Plaza, Juan ...
ADBIS
2010
Springer
136views Database» more  ADBIS 2010»
13 years 10 months ago
New Frontiers in Business Intelligence: Distribution and Personalization
Abstract. To meet the new, more sophisticated needs of decision makers, a new generation of BI systems is emerging. In this paper we focus on two enabling technologies for this new...
Stefano Rizzi
DLT
2003
13 years 10 months ago
Tile Rewriting Grammars
Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free gr...
Stefano Crespi-Reghizzi, Matteo Pradella