3333 search results - page 98 / 667 » Abstract Proof Search |
162
click to vote
PAIRING
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
125
Voted
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
143
Voted
ICCAD
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
141
Voted
ENTCS
2008
15 years 3 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
166
Voted
AMAST
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...