Sciweavers

551 search results - page 53 / 111
» Natural proofs
Sort
View
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 3 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
SCP
2011
255views Communications» more  SCP 2011»
13 years 3 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
IACR
2011
94views more  IACR 2011»
12 years 8 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
CAV
2012
Springer
231views Hardware» more  CAV 2012»
11 years 11 months ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
PKC
2012
Springer
219views Cryptology» more  PKC 2012»
11 years 11 months ago
On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight tha...
Yusuke Sakai, Jacob C. N. Schuldt, Keita Emura, Go...