4047 search results - page 205 / 810 » Some Properties and Some Problems on Set Functors |
145
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
181
click to vote
WIA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
183
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
165
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
147
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: A multi-coupon (MC) represents a collection of k coupons that a user can redeem to a vendor in exchange for a benefit (some good or service). Recently, Chen et al. [CEL+ 07] prop...