Sciweavers

4850 search results - page 191 / 970
» Proof and Computation in Geometry
Sort
View
ASIACRYPT
2000
Springer
15 years 11 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
15 years 10 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
JOC
2007
129views more  JOC 2007»
15 years 6 months ago
Formal Proofs for the Security of Signcryption
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
Joonsang Baek, Ron Steinfeld, Yuliang Zheng
ICLP
2010
Springer
15 years 5 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
PR
2008
138views more  PR 2008»
15 years 6 months ago
Computation of a face attractiveness index based on neoclassical canons, symmetry, and golden ratios
Analysis of attractiveness of faces has long been a topic of research. Literature has identified many different factors that can be related to attractiveness. In this research we ...
Kendra Schmid, David Marx, Ashok Samal