Sciweavers

2601 search results - page 277 / 521
» Secure Rewarding Schemes
Sort
View
TRUSTBUS
2005
Springer
15 years 9 months ago
A Multilateral Secure Payment System for Wireless LAN Hotspots
Beginning with the adoption of the de-facto standard for wireless LAN communications IEEE 802.11 in 1999 we can observe a continuous growth of public wireless LAN hotspots that pro...
Stephan Groß, Sabine Lein, Sandra Steinbrech...
150
Voted
ERSHOV
2003
Springer
15 years 9 months ago
On the Possibility of Provably Secure Obfuscating Programs
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
Nikolay P. Varnovsky, Vladimir A. Zakharov
ACSAC
2002
IEEE
15 years 9 months ago
Thirty Years Later: Lessons from the Multics Security Evaluation
Almost thirty years ago a vulnerability assessment of Multics identified significant vulnerabilities, despite the fact that Multics was more secure than other contemporary (and cu...
Paul A. Karger, Roger R. Schell
ASIACRYPT
2006
Springer
15 years 7 months ago
On the Security of OAEP
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
Alexandra Boldyreva, Marc Fischlin
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval