Sciweavers

2436 search results - page 190 / 488
» Comonadic Notions of Computation
Sort
View
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
15 years 10 months ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud
DIGRA
2005
Springer
15 years 10 months ago
Making Right(s) Decision: Artificial life and Rights Reconsidered
With the proliferation of robotics in industry, education and entertainment, artificial intelligent robots challenge the way we think about relationships between humans and machin...
Juyun Kim
133
Voted
ISPA
2005
Springer
15 years 10 months ago
ID-Based Proxy Signature Using Bilinear Pairings
Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate securit...
Jing Xu, Zhenfeng Zhang, Dengguo Feng
MHCI
2005
Springer
15 years 10 months ago
Context-based design of mobile applications for museums: a survey of existing practices
This paper includes a review of mobile applications used in museum environments, focusing on the notion of context and its constituent dimensions. Museums are a representative exa...
Dimitris Raptis, Nikolaos K. Tselios, Nikolaos M. ...
RTA
2005
Springer
15 years 10 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier