1777 search results - page 46 / 356 » Programming Cryptographic Protocols |
102
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
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...
106
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
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...
CRYPTO
1994
Springer
15 years 5 months ago
1994
Springer
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 ...
104
click to vote
CONCUR
2005
Springer
15 years 6 months ago
2005
Springer
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...
101
click to vote
FC
2009
Springer
15 years 8 months ago
2009
Springer
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 ...