The following pages link to (Q4409144):
Displayed 37 items.
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Concurrent non-malleable statistically hiding commitment (Q436560) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- All-but-many encryption (Q1747665) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Generic Construction of UC-Secure Oblivious Transfer (Q2794494) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Improving Practical UC-Secure Commitments Based on the DDH Assumption (Q2827723) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications (Q2890001) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- Fully Simulatable Quantum-Secure Coin-Flipping and Applications (Q3011901) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles (Q3600228) (← links)
- Initiator-Resilient Universally Composable Key Exchange (Q5030209) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)