Sciweavers

152 search results - page 5 / 31
» Constructive Proofs of Concentration Bounds
Sort
View
SIAMNUM
2011
117views more  SIAMNUM 2011»
13 years 2 months ago
Construction and Convergence Study of Schemes Preserving the Elliptic Local Maximum Principle
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Jérôme Droniou, Christophe Le Potier
EUROCRYPT
2010
Springer
14 years 12 days ago
Public-Key Encryption in the Bounded-Retrieval Model
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. In th...
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Se...
ITA
2000
13 years 7 months ago
Construction of very hard functions for multiparty communication complexity
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
Ján Manuch
POPL
2009
ACM
14 years 8 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 2 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli