Sciweavers

13383 search results - page 119 / 2677
» Abstractions from proofs
Sort
View
ASIACRYPT
2008
Springer
15 years 8 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
189
Voted
ESORICS
2011
Springer
14 years 5 months ago
A Light-Weight Solution to Preservation of Access Pattern Privacy in Un-trusted Clouds
Abstract. Cloud computing is a new computing paradigm that is gaining increased popularity. More and more sensitive user data are stored in the cloud. The privacy of users’ acces...
Ka Yang, Jinsheng Zhang, Wensheng Zhang, Daji Qiao
IACR
2011
223views more  IACR 2011»
14 years 5 months ago
Supplemental Access Control (PACE v2): Security Analysis of PACE Integrated Mapping
Abstract. We describe and analyze the password-based key establishment protocol PACE v2 Integrated Mapping (IM), an evolution of PACE v1 jointly proposed by Gemalto and Sagem S´ec...
Jean-Sébastien Coron, Aline Gouget, Thomas ...
ECAI
2000
Springer
15 years 10 months ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
ENTCS
2006
169views more  ENTCS 2006»
15 years 6 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...