Sciweavers

4850 search results - page 613 / 970
» Proof and Computation in Geometry
Sort
View
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
16 years 7 days ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
PKC
2004
Springer
112views Cryptology» more  PKC 2004»
16 years 6 days ago
Identity-Based Threshold Decryption
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
Joonsang Baek, Yuliang Zheng
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
16 years 6 days ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
DATE
2003
IEEE
81views Hardware» more  DATE 2003»
16 years 5 days ago
Equisolvability of Series vs. Controller's Topology in Synchronous Language Equations
Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...
Nina Yevtushenko, Tiziano Villa, Robert K. Brayton...
159
Voted
LICS
2003
IEEE
16 years 4 days ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...