Computational soundness about formal encryption in the presence of secret shares and key cycles

Authors:
Xinfeng Lei;Rui Xue;Ting Yu
Affiliations:
State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China;Department of Computer Science, North Carolina State University
Venue:
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Year:
2011

Citing 20
Cited 0

A logic of authentication

ACM Transactions on Computer Systems (TOCS)
Entity authentication and key distribution

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A calculus for cryptographic protocols

Information and Computation
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
How to share a secret

Communications of the ACM
Encryption-Scheme Security in the Presence of Key-Dependent Messages

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Computational soundness for standard assumptions of formal cryptography

Computational soundness for standard assumptions of formal cryptography
Controlling access to published data using cryptography

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Security analysis of cryptographically controlled access to XML documents

Journal of the ACM (JACM)
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Circular-Secure Encryption from Decision Diffie-Hellman

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
On the (Im)Possibility of Key Dependent Encryption

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage

Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Towards key-dependent message security in the standard model

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Soundness of formal encryption in the presence of key-cycles

ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Computational soundness, co-induction, and encryption cycles

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Automated security proofs with sequences of games

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational soundness of formal encryption is studied extensively following the work of Abadi and Rogaway[1]. Recent work considers the scenario in which secret sharing is needed, and separately, the scenario when key cycles are present. The novel technique is the use of a co-induction definition of the adversarial knowledge. In this paper, we prove a computational soundness theorem of formal encryption in the presence of both key cycles and secret shares at the same time, which is a non-trivial extension of former approaches.