Sciweavers

989 search results - page 8 / 198
» Pebbling and Proofs of Work
Sort
View
EUROCRYPT
2008
Springer
13 years 10 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
RR
2007
Springer
14 years 3 months ago
Proof Explanation in the DR-DEVICE System
Trust is a vital feature for the Semantic Web: If users (humans and agents) are to use and integrate system answers, they must trust them. Thus, systems should be able to explain t...
Nick Bassiliades, Grigoris Antoniou, Guido Governa...
ASM
2010
ASM
13 years 11 months ago
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
David Déharbe
MLQ
2006
68views more  MLQ 2006»
13 years 9 months ago
On the proof theory of type two functionals based on primitive recursive operations
This paper is a companion to work of Feferman, J
David Steiner, Thomas Strahm
ASIACRYPT
2000
Springer
14 years 1 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or