1401 search results - page 3 / 281 » Randomness in Interactive Proofs |
107
click to vote
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
VSGAMES
2010
14 years 8 months ago
2010
— This paper describes a variety of methods that can be used to create realistic, random 3D environments for serious games requiring real-time performance. These include the gene...
ASIACRYPT
2009
Springer
15 years 1 months ago
2009
Springer
Proofs of storage (PoS) are interactive protocols allowing a client to verify that a server faithfully stores a file. Previous work has shown that proofs of storage can be constru...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...