Theory of Cryptography

DOI10.1007/b95566zbMath1197.94191MaRDI QIDQ5901765

Jörn Müller-Quade, Dennis Hofheinz

Publication date: 14 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95566

zbMATH Keywords

commitment; cryptographic protocols; random oracle; universal composition

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

94A62: Authentication, digital signatures and secret sharing

Related Items

Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework, Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes, Conditional Reactive Simulatability, GUC-secure commitments via random oracles: new impossibility and feasibility, Long-term security and universal composability, All-but-many encryption, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Unifying simulatability definitions in cryptographic systems under different timing assumptions, On the Complexity of Additively Homomorphic UC Commitments, Virtual Smart Cards: How to Sign with a Password and a Server, A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, Structure-Preserving Smooth Projective Hashing, UC-secure and Contributory Password-Authenticated Group Key Exchange, Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness