Sciweavers

503 search results - page 88 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
PODS
2008
ACM
128views Database» more  PODS 2008»
15 years 9 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
DCC
2010
IEEE
14 years 9 months ago
Efficient hybrid encryption from ID-based encryption
This paper deals with generic transformations from ID-based key encapsulation mechanisms (IBKEM) to hybrid public-key encryption (PKE). The best generic transformation known until...
Masayuki Abe, Yang Cui, Hideki Imai, Eike Kiltz
ESOP
2005
Springer
15 years 3 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
JACM
2002
163views more  JACM 2002»
14 years 9 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...