Sciweavers

1825 search results - page 175 / 365
» Cryptographic Securities Exchanges
Sort
View
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
15 years 10 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
Jörn Müller-Quade, Dominique Unruh
IEEEARES
2006
IEEE
15 years 10 months ago
Securing DNS Services through System Self Cleansing and Hardware Enhancements
-- Domain Name Systems (DNS) provide the mapping between easily-remembered host names and their IP addresses. Popular DNS implementations however contain vulnerabilities that are e...
Yih Huang, David Arsenault, Arun Sood
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
ASIACRYPT
2006
Springer
15 years 8 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