How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Non-interactive and non-malleable commitment
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Efficient Non-malleable Commitment Schemes
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key encryption in a multi-user setting: security proofs and improvements
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Mutually Independent Commitments
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Concurrent Non-Malleable Commitments
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
Universally Composable Undeniable Signature
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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 Framework for Efficient and Composable Oblivious Transfer
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 Security Analysis of TLS
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
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
Composability and On-Line Deniability of Authentication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Black-Box Constructions of Two-Party Protocols from One-Way Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Towards a Theory of Extractable Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Essentially Optimal Universally Composable Oblivious Transfer
Information Security and Cryptology --- ICISC 2008
New Constructions for Reusable, Non-erasure and Universally Composable Commitments
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Local Sequentiality Does Not Help for Concurrent Composition
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
On Tamper-Resistance from a Theoretical Viewpoint
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Efficient Non-interactive Universally Composable String-Commitment Schemes
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Quantum-Secure Coin-Flipping and Applications
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Multi-party Computation Minimizing Online Rounds
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Multiparty computation for dishonest majority: from passive to active security at low cost
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
A zero-one law for cryptographic complexity with respect to computational UC security
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Inductive trace properties for computational security
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Efficient implementation of the orlandi protocol
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Adaptive and composable non-committing encryptions
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Identity-based proxy cryptosystems with revocability and hierarchical confidentialities
ICICS'10 Proceedings of the 12th international conference on Information and communications security
Contributory password-authenticated group key exchange with join capability
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Unconditional and composable security using a single stateful tamper-proof hardware token
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Concurrent non-malleable zero knowledge with adaptive inputs
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
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Constant-round non-malleable commitments from any one-way function
Proceedings of the forty-third annual ACM symposium on Theory of computing
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Highly-efficient universally-composable commitments based on the DDH assumption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Public-key encryptions tolerating adaptive and composable adversaries
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
On constant-round concurrent non-malleable proof systems
Information Processing Letters
Error-free, multi-bit non-committing encryption with constant round complexity
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Physically uncloneable functions in the universal composition framework
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Leakage-resilient zero knowledge
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Universally composable private proximity testing
ProvSec'11 Proceedings of the 5th international conference on Provable security
Universally composable NIZK protocol in an internet voting scheme
STM'10 Proceedings of the 6th international conference on Security and trust management
Universally composable identity-based encryption
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Independent zero-knowledge sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
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
On the necessary and sufficient assumptions for UC computation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Eye for an eye: efficient concurrent zero-knowledge in the timing model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Relaxing environmental security: monitored functionalities and client-server computation
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On the relationships between notions of simulation-based security
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Secure computation without authentication
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Universally composable time-stamping schemes with audit
ISC'05 Proceedings of the 8th international conference on Information Security
Secure protocols for complex tasks in complex environments
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
A framework for universally composable non-committing blind signatures
International Journal of Applied Cryptography
Universally composable zero-knowledge sets
International Journal of Grid and Utility Computing
Limits of the BRSIM/UC soundness of dolev-yao models with hashes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Conditional reactive simulatability
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Universally composable quantum multi-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Round-optimal composable blind signatures in the common reference string model
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
BGN authentication and its extension to convey message commitments
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Syntax-Driven private evaluation of quantified membership queries
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
On the (im-)possibility of extending coin toss
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Towards provable security for ubiquitous applications
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Adaptive and composable oblivious transfer protocols (short paper)
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Generalized environmental security from number theoretic assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Games and the impossibility of realizable ideal functionality
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Resource fairness and composability of cryptographic 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
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
BiTR: built-in tamper resilience
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Leakage-Tolerant interactive protocols
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Concurrently secure computation in constant rounds
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Brief announcement: distributed cryptography using trinc
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
Trading static for adaptive security in universally composable zero-knowledge
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable 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
Public-Coin concurrent zero-knowledge in the global hash model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Characterizing the cryptographic properties of reactive 2-party functionalities
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Universally composable synchronous computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Implementing resettable UC-Functionalities with untrusted tamper-proof hardware-tokens
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Heart-to-heart (H2H): authentication for implanted medical devices
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Universally composable adaptive oblivious transfer (with access control) from standard assumptions
Proceedings of the 2013 ACM workshop on Digital identity management
Analysis and improvement of lindell's UC-secure commitment schemes
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Constant-round adaptive zero-knowledge proofs for NP
Information Sciences: an International Journal
| Hi-index | 0.00 |
We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an "ideal commitment service," even when concurrently composed with an arbitrary set of protocols. This is a strong guarantee: it implies that security is maintained even when an unbounded number of copies of the scheme are running concurrently, it implies non-malleability (not only with respect to other copies of the same protocol but even with respect to other protocols), it provides resilience to selective decommitment, and more. Unfortunately, two-party uc commitment protocols do not exist in the plain model. However, we construct two-party uc commitment protocols, based on general complexity assumptions, in the common reference string model where all parties have access to a common string taken from a predetermined distribution. The protocols are non-interactive, in the sense that both the commitment and the opening phases consist of a single message from the committer to the receiver.