Universally Composable Commitments
CRYPTO '01 Proceedings of the 21st 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
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
CRYPTO '98 Proceedings of the 18th 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
Minimum resource zero knowledge proofs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th 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
Non-interactive and reusable non-malleable commitment schemes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Foundations and applications for secure triggers
ACM Transactions on Information and System Security (TISSEC)
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
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 Straight-Line Extractable Non-malleable Commitment Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Universally Composable Identity-Based Encryption
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Essentially Optimal Universally Composable Oblivious Transfer
Information Security and Cryptology --- ICISC 2008
Efficient Non-interactive Universally Composable String-Commitment Schemes
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Long-term security and universal composability
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Concurrently-secure blind signatures without random oracles or setup assumptions
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Equivocal blind signatures and adaptive UC-security
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge with adaptive inputs
TCC'11 Proceedings of the 8th conference on Theory of cryptography
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
Fully simulatable quantum-secure coin-flipping and applications
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Universally composable identity-based encryption
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Hybrid trapdoor commitments and their applications
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Cryptography in subgroups of Zn
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
More constructions of lossy and correlation-secure trapdoor functions
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Syntax-Driven private evaluation of quantified membership queries
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Adaptive and composable oblivious transfer protocols (short paper)
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Mercurial commitments: minimal assumptions and efficient constructions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Concurrent non-malleable statistically hiding commitment
Information Processing Letters
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
New constructions of efficient simulation-sound commitments using encryption and their applications
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Efficient RSA key generation and threshold paillier in the two-party setting
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
All-But-Many lossy trapdoor functions
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On definitions of selective opening security
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Trading static for adaptive security in universally composable zero-knowledge
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A new approach for private searches on public-key encrypted data
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Analysis and improvement of lindell's UC-secure commitment schemes
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Journal of Computer Security - Advances in Security for Communication Networks
Hi-index | 0.00 |
Canetti and Fischlin have recently proposed the security notion universal composability for commitment schemes and provided two examples. This new notion is very strong. It guarantees that security is maintained even when an unbounded number of copies of the scheme are running concurrently, also it guarantees non-malleability and security against adaptive adversaries. Both proposed schemes use 驴(k) bits to commit to one bit and can be based on the existence of trapdoor commitments and non-malleable encryption.We present new universally composable commitment (UCC) schemes based on extractable q one-way homomorphisms. These in turn exist based on the Paillier cryptosystem, the Okamoto-Uchiyama cryptosystem, or the DDH assumption. The schemes are efficient: to commit to k bits, they use a constant number of modular exponentiations and communicates O(k) bits. Furthermore the scheme can be instantiated in either perfectly hiding or perfectly binding versions. These are the first schemes to show that constant expansion factor, perfect hiding, and perfect binding can be obtained for universally composable commitments.We also show how the schemes can be applied to do efficient zero-knowledge proofs of knowledge that are universally composable.