Sciweavers

9370 search results - page 100 / 1874
» An Abstract Notion of Application
Sort
View
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
14 years 3 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
MFCS
2005
Springer
15 years 6 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
95
Voted
ESORICS
2003
Springer
15 years 5 months ago
Initiator-Resilient Universally Composable Key Exchange
Abstract. Key exchange protocols in the setting of universal composability are investigated. First we show that the ideal functionality FKE of [9] cannot be realized in the presenc...
Dennis Hofheinz, Jörn Müller-Quade, Rain...
88
Voted
FOSSACS
2003
Springer
15 years 5 months ago
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
Franck van Breugel, Michael W. Mislove, Joël ...
102
Voted
FM
1999
Springer
104views Formal Methods» more  FM 1999»
15 years 5 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf