Sciweavers

1401 search results - page 143 / 281
» Randomness in Interactive Proofs
Sort
View
ENTCS
2008
90views more  ENTCS 2008»
14 years 10 months ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
CPP
2011
98views more  CPP 2011»
13 years 9 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 5 months ago
Convergence of type-symmetric and cut-balanced consensus seeking systems
We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
Julien M. Hendrickx, John N. Tsitsiklis
EUROCRYPT
2007
Springer
15 years 1 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 5 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman