The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing
Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Universally Composable Signature, Certification, and Authentication
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Off-the-record communication, or, why not to use PGP
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
The dual receiver cryptosystem and its applications
Proceedings of the 11th ACM conference on Computer and communications security
Universally Composable Protocols with Relaxed Set-Up Assumptions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Journal of the ACM (JACM)
New approaches for deniable authentication
Proceedings of the 12th ACM conference on Computer and communications security
Secure off-the-record messaging
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Deniable authentication and key exchange
Proceedings of the 13th ACM conference on Computer and communications security
SIAM Journal on Computing
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On the concurrent composition of zero-knowledge proofs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient and non-malleable proofs of plaintext knowledge and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Deniable authenticated key establishment for internet protocols
Proceedings of the 11th international conference on Security Protocols
Ring signatures: stronger definitions, and constructions without random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Deniable internet key exchange
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Universally composable security with local adversaries
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
OAKE: a new family of implicitly authenticated diffie-hellman protocols
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Improved group off-the-record messaging
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Deniability and forward secrecy of one-round authenticated key exchange
The Journal of Supercomputing
| Hi-index | 0.00 |
Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability , where deniability should hold even when one of the parties colludes with a third party during execution of the protocol. This turns out to generalize several realistic scenarios that are outside the scope of previous models. We show that a protocol achieves our definition of on-line deniability if and only if it realizes the message authentication functionality in the generalized universal composability framework; any protocol satisfying our definition thus automatically inherits strong composability guarantees. Unfortunately, we show that our definition is impossible to realize in the PKI model if adaptive corruptions are allowed (even if secure erasure is assumed). On the other hand, we show feasibility with respect to static corruptions (giving the first separation in terms of feasibility between the static and adaptive setting), and show how to realize a relaxation termed deniability with incriminating abort under adaptive corruptions.