On interdomain routing security and pretty secure BGP (psBGP)
ACM Transactions on Information and System Security (TISSEC)
Multivariates Polynomials for Hashing
Information Security and Cryptology
CROO: A Universal Infrastructure and Protocol to Detect Identity Fraud
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Modeling and Verification of Privacy Enhancing Protocols
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Proving tight security for Rabin-Williams signatures
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Choosing key sizes for cryptography
Information Security Tech. Report
A security framework for privacy-preserving data aggregation in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Interpreting hash function security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
A new security proof of practical cryptographic devices based on hardware, software and protocols
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Gate elimination for linear functions and new feebly secure constructions
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Efficient defence against misbehaving TCP receiver DoS attacks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Another look at “provable security”. II
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
A protocol for secure public instant messaging
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
A practical and tightly secure signature scheme without hash function
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Optimal security proofs for full domain hash, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A "proof-reading" of some issues in cryptography
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Blind 384-bit digital signature scheme
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
Cryptanalysis vs. provable security
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Stronger security model for public-key encryption with equality test
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
SCADA system security, complexity, and security proof
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
| Hi-index | 0.01 |
We give an informal analysis and critique of several typical "provable security" results. In some cases there are intuitive but convincing arguments for rejecting the conclusions suggested by the formal terminology and "proofs," whereas in other cases the formalism seems to be consistent with common sense. We discuss the reasons why the search for mathematically convincing theoretical evidence to support the security of public-key systems has been an important theme of researchers. However, we argue that the theorem-proof paradigm of theoretical mathematics is often of limited relevance here and frequently leads to papers that are confusing and misleading. Because our paper is aimed at the general mathematical public, it is self-contained and as jargon-free as possible.