نتایج جستجو برای: practical proof

تعداد نتایج: 334168  

2015
Emilio Jesús Gallego Arias Olivier Hermant Pierre Jouvelot

We address the question of what software verification can do for the audio community by showcasing some preliminary design ideas and tools for a new framework dedicated to the formal reasoning about Faust programs. We use as a foundation one of the strongest current proof assistants, namely Coq combined with SSReflect. We illustrate the practical impact of our approach via a use case, namely th...

2008
Jean Goubault-Larrecq

First-order logic models of security for cryptographicprotocols, based on variants of the Dolev-Yao model, arenow well-established tools. Given that we have checked agiven security protocol π using a given first-order prover,how hard is it to extract a formally checkable proof of it,as required in, e.g., common criteria at evaluation level 7?We demonstrate that this is s...

2000
Victor Shoup

The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decisional Diffie-Hellman assumption is true. Although this is a reasonable intractability assumption, it would be preferable to base a security proof on a weaker assumption, such as the Computational Diffie-Hellman assumption...

Journal: :IACR Cryptology ePrint Archive 2014
Payman Mohassel Seyed Saeed Sadeghian Nigel P. Smart

We propose the first general framework for designing actively secure private function evaluation (PFE), not based on universal circuits. Our framework is naturally divided into pre-processing and online stages and can be instantiated using any generic actively secure multiparty computation (MPC) protocol. Our framework helps address the main open questions about efficiency of actively secure PF...

2012
Alison Young Russell H. Fazio

Previous research on attitude accessibility has found that accessible attitudes influence both visual and cognitive attention. Smith, Fazio, and Cejka (1996), for instance, found that categories towards which we have accessible attitudes are more likely to be brought to mind when assessing a related object. Research in our lab (Young & Fazio, in prep) has found evidence that not only are catego...

2003
Ruth Garrett Millikan

By whatever general principles and mechanisms animal behavior is governed, human behavior control rides piggyback on top of the same or very similar mechanisms. We have reflexes. We can be conditioned. The movements that make up our smaller actions are mostly caught up in perception-action cycles following perceived Gibsonian affordances. Still, without doubt there are levels of behavior contro...

2015
M. J. C. Gordon

Robin Milner's paper, 'The use of machines to assist in rigorous proof', introduces methods for automating mathematical reasoning that are a milestone in the development of computer-assisted theorem proving. His ideas, particularly his theory of tactics, revolutionized the architecture of proof assistants. His methodology for automating rigorous proof soundly, particularly his theory of type po...

2015
Oliver Koch Alexander Benlian

Online referrals have become an important mechanism in leveraging consumers’ social networks to spread firms’ promotional campaigns and thus attract new customers. However, despite a robust understanding of the benefits and drivers of consumer referrals, only minimal attention has been paid towards the potential of classical promotional tactics in influencing referral behavior. Therefore, this ...

2013
Wang Huqing Sun Zhixin

Zero-knowledge proof protocol is a critical component of cryptography, which in recent years has raised increasing concern of many scholars.Its application field is very extensive,and it has made breakthrough progress in many aspects,including mathematics and network safety and so on. This article launches the elaboration from the concept, nature, mathematics theory, general proof process of th...

2017
Ondrej Kuncar Andrei Popescu

The proof assistant Isabelle/HOL is based on an extension of HigherOrder Logic (HOL) with ad hoc overloading of constants. It turns out that the interaction between the standard HOL type definitions and the Isabelle-specific ad hoc overloading is problematic for the logical consistency. In previous work, we have argued that standard HOL semantics is no longer appropriate for capturing this inte...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید