Sciweavers

14 search results - page 2 / 3
» Pseudo-Superstructures as Nonstandard Universes
Sort
View
ESORICS
2004
Springer
15 years 3 months ago
Towards a Theory of Data Entanglement: (Extended Abstract)
d Abstract) James Aspnes , Joan Feigenbaum , Aleksandr Yampolskiy † , and Sheng Zhong ‡ Department of Computer Science, Yale University, New Haven CT 06520-8285, USA Abstract. ...
James Aspnes, Joan Feigenbaum, Aleksandr Yampolski...
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
15 years 3 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
GOSLER
1995
15 years 1 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
EWRL
2008
14 years 11 months ago
New Error Bounds for Approximations from Projected Linear Equations
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
Huizhen Yu, Dimitri P. Bertsekas
WOTE
2010
14 years 8 months ago
On Some Incompatible Properties of Voting Schemes
Abstract. In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. More specifically, we ...
Benoît Chevallier-Mames, Pierre-Alain Fouque...