154 search results - page 10 / 31 » Using Proofs by Coinduction to Find |
135
click to vote
ASIACRYPT
2006
Springer
15 years 8 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
124
click to vote
ENTCS
2006
15 years 4 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
116
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
134
click to vote
ICSAP
2010
15 years 6 months ago
2010
- This paper describes a novel algorithm designed for tamper proofing of 3D models. Fragile watermarking is a known technique for detecting location of tamper in the artwork. Howev...
148
click to vote
PLPV
2009
ACM
16 years 1 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...