Sciweavers

3742 search results - page 650 / 749
» On the Use of Formal Techniques for Validation
Sort
View
FMCAD
2007
Springer
16 years 15 days ago
Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC
—When model-checking reports that a property holds on a model, vacuity detection increases user confidence in this result by checking that the property is satisfied in the inte...
Jocelyn Simmonds, Jessica Davies, Arie Gurfinkel, ...
ASIACRYPT
2007
Springer
15 years 10 months ago
On Tweaking Luby-Rackoff Blockciphers
Abstract. Tweakable blockciphers, first formalized by Liskov, Rivest, and Wagner [13], are blockciphers with an additional input, the tweak, which allows for variability. An open p...
David Goldenberg, Susan Hohenberger, Moses Liskov,...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
AAAI
2007
15 years 8 months ago
Real Arguments Are Approximate Arguments
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...
Anthony Hunter
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
15 years 7 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...