Sciweavers

108 search results - page 4 / 22
» Verifying Design with Proof Scores
Sort
View
MPC
2010
Springer
147views Mathematics» more  MPC 2010»
14 years 1 months ago
Designing an Algorithmic Proof of the Two-Squares Theorem
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
João F. Ferreira
JSS
2007
105views more  JSS 2007»
13 years 8 months ago
Composing pattern-based components and verifying correctness
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan, S...
SEFM
2007
IEEE
14 years 2 months ago
Verifying Security Properties of Cryptoprotocols: A Novel Approach
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
Mohamed Saleh, Mourad Debbabi
BMCBI
2010
120views more  BMCBI 2010»
13 years 8 months ago
KiDoQ: using docking based energy scores to develop ligand based model for predicting antibacterials
Background: Identification of novel drug targets and their inhibitors is a major challenge in the field of drug designing and development. Diaminopimelic acid (DAP) pathway is a u...
Aarti Garg, Rupinder Tewari, Gajendra P. S. Raghav...
EUROCRYPT
2009
Springer
14 years 9 months ago
On the Portability of Generalized Schnorr Proofs
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
Jan Camenisch, Aggelos Kiayias, Moti Yung