397 search results - page 49 / 80 » Pseudorandom Functions and Lattices |
110
click to vote
EUROCRYPT
2004
Springer
15 years 6 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
132
click to vote
CRYPTO
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
104
click to vote
DATE
1998
IEEE
15 years 5 months ago
1998
IEEE
Built-in self-test BIST techniques modify functional hardware to give a data path the capability to test itself. The modi cation of data path registers into registers BIST resourc...
ATS
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper considers the testability implications of low power design methodologies. Low power and high testability are shown to be highly contrasting requirements, and an optimiz...