Sciweavers

566 search results - page 39 / 114
» Array Abstractions from Proofs
Sort
View
ASIACRYPT
2010
Springer
13 years 5 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
CONCUR
1999
Springer
14 years 11 hour ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
BIRTHDAY
2008
Springer
13 years 9 months ago
From Domain to Requirements
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
Dines Bjørner
BIRTHDAY
2006
Springer
13 years 11 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle