Sciweavers

922 search results - page 68 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 10 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
CHES
2007
Springer
105views Cryptology» more  CHES 2007»
14 years 4 months ago
On the Implementation of a Fast Prime Generation Algorithm
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
Christophe Clavier, Jean-Sébastien Coron
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 4 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
FROCOS
2005
Springer
14 years 3 months ago
Connecting a Logical Framework to a First-Order Logic Prover
We present one way of combining a logical framework and first-order logic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to k...
Andreas Abel, Thierry Coquand, Ulf Norell
FMCAD
2004
Springer
14 years 3 months ago
Integrating Reasoning About Ordinal Arithmetic into ACL2
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
Panagiotis Manolios, Daron Vroon