Sciweavers

2432 search results - page 71 / 487
» Cryptographic logical relations
Sort
View
TIME
2007
IEEE
15 years 4 months ago
Temporalising Tractable Description Logics
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
AAAI
2010
14 years 11 months ago
Structure Learning for Markov Logic Networks with Many Descriptive Attributes
Many machine learning applications that involve relational databases incorporate first-order logic and probability. Markov Logic Networks (MLNs) are a prominent statistical relati...
Hassan Khosravi, Oliver Schulte, Tong Man, Xiaoyua...
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
15 years 4 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
FSTTCS
2007
Springer
15 years 4 months ago
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
Michael Backes, Markus Dürmuth, Ralf Küs...
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 4 months ago
An evolutionary multiobjective approach to design highly non-linear Boolean functions
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...
Hernán E. Aguirre, Hiroyuki Okazaki, Yasush...