Pages that link to "Item:Q5172711"

The following pages link to A unified framework for concurrent security (Q5172711):

Displaying 20 items.

• Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
• Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
• On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
• Non-malleable commitments against quantum attacks (Q2170101) (← links)
• On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
• Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
• On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
• Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
• Cryptography Using Captcha Puzzles (Q4916003) (← links)
• An Algebraic Approach to Nonmalleability (Q5157398) (← links)
• Constant-Round Nonmalleable Commitments from Any One-Way Function (Q5501951) (← links)
• Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
• Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
• On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)