Publication:4409144

zbMath1028.94505MaRDI QIDQ4409144

Jesper Buus Nielsen, Ivan B. Damgård

Publication date: 30 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420581.htm

zbMATH Keywords

binding; cryptosystem; universal composability; commitment schemes; hiding; one-way homomorphisms

Mathematics Subject Classification ID

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

Related Items

Initiator-Resilient Universally Composable Key Exchange, Equivocal Blind Signatures and Adaptive UC-Security, Efficient non-malleable commitment schemes, Scalable Multi-party Private Set-Intersection, Efficient non-malleable commitment schemes, Cumulatively all-lossy-but-one trapdoor functions from standard assumptions, Non-interactive zero-knowledge from non-interactive batch arguments, Tightly secure signatures and public-key encryption, Efficient set operations in the presence of malicious adversaries, Concurrent non-malleable statistically hiding commitment, Efficient one-sided adaptively secure computation, Long-term security and universal composability, Resource fairness and composability of cryptographic protocols, Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model, Cryptography in the multi-string model, Hybrid commitments and their applications to zero-knowledge proof systems, All-but-many encryption, More constructions of lossy and correlation-secure trapdoor functions, Everlasting multi-party computation, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Always have a backup plan: fully secure synchronous MPC with asynchronous fallback, Threshold Schnorr with stateless deterministic signing from standard assumptions, Somewhere statistically binding commitment schemes with applications, Everlasting UC commitments from fully malicious PUFs, On black-box complexity of universally composable security in the CRS model, Efficient RSA key generation and threshold Paillier in the two-party setting, Efficient and round-optimal oblivious transfer and commitment with adaptive security, Generic Construction of UC-Secure Oblivious Transfer, On the Complexity of Additively Homomorphic UC Commitments, Improving Practical UC-Secure Commitments Based on the DDH Assumption, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications, Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Compact and Efficient UC Commitments Under Atomic-Exchanges, Fully Simulatable Quantum-Secure Coin-Flipping and Applications, From Passive to Covert Security at Low Cost, On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles