scientific article; zbMATH DE number 1942445
From MaRDI portal
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Tightly secure signatures and public-key encryption ⋮ Somewhere statistically binding commitment schemes with applications ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Long-term security and universal composability ⋮ Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Concurrent non-malleable statistically hiding commitment ⋮ Resource fairness and composability of cryptographic protocols ⋮ Fully Simulatable Quantum-Secure Coin-Flipping and Applications ⋮ All-but-many encryption ⋮ Efficient one-sided adaptively secure computation ⋮ Everlasting multi-party computation ⋮ Efficient non-malleable commitment schemes ⋮ Scalable Multi-party Private Set-Intersection ⋮ Efficient non-malleable commitment schemes ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ 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 ⋮ Improving Practical UC-Secure Commitments Based on the DDH Assumption ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ On black-box complexity of universally composable security in the CRS model ⋮ From Passive to Covert Security at Low Cost ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Initiator-Resilient Universally Composable Key Exchange
This page was built for publication:
