Sciweavers

793 search results - page 45 / 159
» Argumentation and standards of proof
Sort
View
111
Voted
CSL
2010
Springer
15 years 1 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
111
Voted
FSE
2004
Springer
125views Cryptology» more  FSE 2004»
15 years 4 months ago
New Security Proofs for the 3GPP Confidentiality and Integrity Algorithms
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...
Tetsu Iwata, Tadayoshi Kohno
117
Voted
TCS
2010
14 years 11 months ago
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
Michele Pagani, Lorenzo Tortora de Falco
88
Voted
SCN
2010
Springer
138views Communications» more  SCN 2010»
14 years 11 months ago
A Security Enhancement and Proof for Authentication and Key Agreement (AKA)
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
Vladimir Kolesnikov
ASIACRYPT
2006
Springer
15 years 4 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth