Sciweavers

123 search results - page 17 / 25
» Semantic Encryption Transformation Scheme
Sort
View
CTRSA
2006
Springer
118views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Stand-Alone and Setup-Free Verifiably Committed Signatures
Abstract. In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signat...
Huafei Zhu, Feng Bao
SEFM
2006
IEEE
14 years 1 months ago
A PVS Based Framework for Validating Compiler Optimizations
An optimization can be specified as sequential compositions of predefined transformation primitives. For each primitive, we can define soundness conditions which guarantee that th...
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
FOAL
2007
ACM
13 years 11 months ago
Requirement enforcement by transformation automata
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
Douglas R. Smith
ASIACRYPT
2009
Springer
14 years 2 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
LICS
2008
IEEE
14 years 1 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...