Sciweavers

1777 search results - page 46 / 356
» Programming Cryptographic Protocols
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand
IFIP
2004
Springer
14 years 2 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
CRYPTO
1994
Springer
104views Cryptology» more  CRYPTO 1994»
14 years 23 days ago
Cryptographic Randomness from Air Turbulence in Disk Drives
Abstract. A computer disk drive's motor speed varies slightly but irregularly, principally because of air turbulence inside the disk's enclosure. The unpredictability of ...
Don Davis, Ross Ihaka, Philip Fenstermacher
CONCUR
2005
Springer
14 years 2 months ago
Selecting Theories and Recursive Protocols
Many decidability results are known for non-recursive cryptographic protocols, where the protocol steps can be expressed by simple rewriting rules. Recently, a tree transducer-base...
Tomasz Truderung
FC
2009
Springer
134views Cryptology» more  FC 2009»
14 years 3 months ago
Cryptographic Combinatorial Securities Exchanges
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Christopher Thorpe, David C. Parkes