Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ASIACRYPT
2005
Springer

favoriteEmaildiscussreport

103views Cryptology» more ASIACRYPT 2005»

Errors in Computational Complexity Proofs for Protocols

13 years 10 months ago

Errors in Computational Complexity Proofs for Protocols

Download eprint.iacr.org

Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco

Real-time Traffic

ASIACRYPT 2005 | Cryptology |

claim paper

Related Content

» Parallel Repetition of Computationally Sound Protocols Revisited

» A Direct Sum Theorem in Communication Complexity via Message Compression

» Computationally Sound Automated Proofs for Security Protocols

» ConstantRound Multiparty Computation Using a BlackBox Pseudorandom Generator

» A Proof Technique for Liveness Properties of Multifunction Composite Protocols

» On Optimal Heuristic Randomized Semidecision Procedures with Application to Proof Complexi...

» Verifying Computations with Streaming Interactive Proofs

» Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates

» High Complexity Tilings with Sparse Errors

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	ASIACRYPT
Authors	Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock

Comments (0)