Sciweavers

4850 search results - page 152 / 970
» Proof and Computation in Geometry
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Zero-Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Oded Goldreich
CIE
2006
Springer
15 years 10 months ago
Deep Inference and Its Normal Form of Derivations
Abstract. We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notio...
Kai Brünnler
CORR
2010
Springer
166views Education» more  CORR 2010»
15 years 4 months ago
Computer Aided Design Modeling for Heterogeneous Objects
Heterogeneous object design is an active research area in recent years. The conventional CAD modeling approaches only provide geometry and topology of the object, but do not conta...
Vikas Gupta, K. S. Kasana, Puneet Tandon
CCS
2008
ACM
15 years 8 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
16 years 14 days ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet