Composition and integrity preservation of secure reactive systems
Proceedings of the 7th ACM conference on Computer and communications security
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on 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
Strict Polynomial-Time in Simulation and Extraction
SIAM Journal on Computing
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New notions of security: achieving universal composability without trusted setup
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Universally Composable Signature, Certification, and Authentication
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Universally Composable Protocols with Relaxed Set-Up Assumptions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the limitations of universally composable two-party computation without set-up assumptions
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Secure computation without authentication
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
ACM SIGACT news distributed computing column 24
ACM SIGACT News
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
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 Adaptive Oblivious Transfer
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Safely composing security protocols
Formal Methods in System Design
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science
A note on the feasibility of generalised universal composability†
Mathematical Structures in Computer Science
Composability and On-Line Deniability of Authentication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Universally Composable Multiparty Computation with Partially Isolated Parties
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Simple, Black-Box Constructions of Adaptively Secure Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Non-interactive Universally Composable String-Commitment Schemes
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
GUC-Secure Set-Intersection Computation
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
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
How to build a hash function from any collision-resistant function
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
New constructions for UC secure computation using tamper-proof hardware
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Universally composable multi-party computation with an unreliable common reference string
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Credential authenticated identification and key exchange
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Universally composable incoercibility
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Unconditional and composable security using a single stateful tamper-proof hardware token
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Bringing people of different beliefs together to do UC
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On constant-round concurrent non-malleable proof systems
Information Processing Letters
Physically uncloneable functions in the universal composition framework
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Classical cryptographic protocols in a quantum world
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
GUC-Secure join operator in distributed relational database
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
A framework for practical universally composable zero-knowledge protocols
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Non-interactive and re-usable universally composable string commitments with adaptive security
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Efficient ID-based non-malleable trapdoor commitment
Computers and Electrical Engineering
Universally composable security with local adversaries
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Security enhancement of identity-based identification with reversibility
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
A unified framework for UC from only OT
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
A zero-knowledge based framework for RFID privacy
Journal of Computer Security - ESORICS 2010
| Hi-index | 0.00 |
Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information that is trusted to have some basic security properties. However, current modeling of security in the presence of such set-up falls short of providing the expected security guarantees. A quintessential example of this phenomenon is the deniability concern: there exist natural protocols that meet the strongest known composable security notions, and are still vulnerable to bad interactions with rogue protocols that use the same set-up. We extend the notion of universally composable (UC) security in a way that re-establishes its original intuitive guarantee even for protocols that use globally available set-up. The new formulation prevents bad interactions even with adaptively chosen protocols that use the same set-up. In particular, it guarantees deniability. While for protocols that use no setup the proposed requirements are the same as in traditional UC security, for protocols that use global set-up the proposed requirements are significantly stronger. In fact, realizing Zero Knowledge or commitment becomes provably impossible, even in the Common Reference String model. Still, we propose reasonable alternative set-up assumptions and protocols that allow realizing practically any cryptographic task under standard hardness assumptions even against adaptive corruptions.