Towards computationally sound symbolic analysis of key exchange protocols
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Compact sequential aggregate signatures
Proceedings of the 2007 ACM symposium on Applied computing
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
An optimistic fair exchange protocol and its security in the universal composability framework
International Journal of Applied Cryptography
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Universally Composable Security Analysis of TLS
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Universally Composable Identity-Based Encryption
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Composability and On-Line Deniability of Authentication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On Universal Composable Security of Time-Stamping Protocols
Proceedings of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
Polynomial runtime in simulatability definitions
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
A Framework for Universally Composable Non-committing Blind Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Multi-party stand-alone and setup-free verifiably committed signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A closer look at PKI: security and efficiency
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Obtaining universally compoable security: towards the bare bones of trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Legally-enforceable fairness in secure two-party computation
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Ideal key derivation and encryption in simulation-based security
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A composable computational soundness notion
Proceedings of the 18th ACM conference on Computer and communications security
Universally composable identity-based encryption
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
A universally composable scheme for electronic cash
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Universally composable oblivious transfer in the multi-party setting
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
A framework for universally composable non-committing blind signatures
International Journal of Applied Cryptography
Round-optimal composable blind signatures in the common reference string model
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Simplified threshold RSA with adaptive and proactive security
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
A framework for universally composable non-committing blind signatures
International Journal of Applied Cryptography
Constructive cryptography --- a new paradigm for security definitions and proofs
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Practical yet universally composable two-server password-authenticated secret sharing
Proceedings of the 2012 ACM conference on Computer and communications security
Trading static for adaptive security in universally composable zero-knowledge
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Concurrent zero knowledge in the bounded player model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
Recently some efforts were made towards capturingthe security requirements from digital signature schemesas an ideal functionality within a composable securityframework.This modeling of digital signatures potentiallyhas some significant analytical advantages (suchas enabling component-wise analysis of complex systemsthat use signature schemes, as well as symbolic and automatableanalysis of such systems).However, it turnsout that formulating ideal functionalities that capture theproperties expected from signature schemes in a way thatis both sound and enjoys the above advantages is not atrivial task.This work has several contributions.We first correctsome flaws in the definition of the ideal signature functionalityof Canetti, 2001, and subsequent formulations.Next we provide a minimal formalization of "ideal certificationauthorities" and show how authenticated communicationcan be obtained using ideal signatures and anideal certification authority.This is done while guaranteeingfull modularity (i.e., each component is analyzed asstand-alone), and in an unconditional and errorless way.This opens the door to symbolic and automated analysisof protocols for these tasks, in a way that is both modularand cryptographically sound.