Sciweavers

Share
EUROCRYPT
2012
Springer
6 years 5 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...
IACR
2011
94views more  IACR 2011»
7 years 3 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
CRYPTO
2011
Springer
180views Cryptology» more  CRYPTO 2011»
7 years 3 months ago
Leakage-Resilient Zero Knowledge
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
Sanjam Garg, Abhishek Jain 0002, Amit Sahai
JAR
2010
123views more  JAR 2010»
8 years 1 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
ECCC
2010
98views more  ECCC 2010»
8 years 2 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
TCS
2002
8 years 3 months ago
Logical systems for structured specifications
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
Tomasz Borzyszkowski
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
8 years 3 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ENTCS
2007
92views more  ENTCS 2007»
8 years 3 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer
CORR
2007
Springer
70views Education» more  CORR 2007»
8 years 3 months ago
On the Proof Complexity of Deep Inference
We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin exte...
Paola Bruscoli, Alessio Guglielmi
CSR
2009
Springer
8 years 6 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
books