171 search results - page 10 / 35 » CoSP: a general framework for computational soundness proofs |
123
click to vote
TLCA
1997
Springer
15 years 3 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
94
Voted
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
Sound source localization is an important function in robot audition. The existing works perform sound source localization using static microphone arrays. This work proposes a fram...
83
Voted
SP
2009
IEEE
15 years 6 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
108
click to vote
KRDB
2003
15 years 1 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...