1401 search results - page 50 / 281 » Randomness in Interactive Proofs |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically s...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
EUROGP
2001
Springer
15 years 2 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...