The following pages link to Rafael Pass (Q332269):
Displaying 50 items.
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Multi-verifier signatures (Q431790) (← links)
- Secure computation without authentication (Q656923) (← links)
- Iterated regret minimization: a new solution concept (Q665088) (← links)
- Game theory with translucent players (Q1621735) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Achieving fair treatment in algorithmic classification (Q1629438) (← links)
- Thunderella: blockchains with optimistic instant confirmation (Q1648817) (← links)
- On the impossibility of cryptography with tamperable randomness (Q1688399) (← links)
- Can we access a database both locally and privately? (Q1690289) (← links)
- The sleepy model of consensus (Q1703930) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- Reasoning about rationality (Q2013339) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? (Q2055669) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Impossibility of strong KDM security with auxiliary input (Q2106665) (← links)
- Unprovability of leakage-resilient cryptography beyond the information-theoretic limit (Q2106672) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Synchronous, with a chance of partition tolerance (Q2181863) (← links)
- Bayesian games with intentions (Q2206799) (← links)
- Algorithmic rationality: game theory with costly computation (Q2253839) (← links)
- On the existence of Nash equilibrium in games with resource-bounded players (Q2292618) (← links)
- Non-uniformly sound certificates with applications to concurrent zero-knowledge (Q2304916) (← links)
- Conservative belief and rationality (Q2435900) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Minimizing trust in hardware wallets with two factor signatures (Q2656920) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Limits of Extractability Assumptions with Distributional Auxiliary Input (Q2795973) (← links)
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings (Q2796115) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Indistinguishability Obfuscation with Non-trivial Efficiency (Q2798810) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- Bounded KDM Security from iO and OWF (Q2827740) (← links)
- On the Impossibility of Cryptography with Tamperable Randomness (Q2874520) (← links)
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings (Q2874522) (← links)
- The Knowledge Tightness of Parallel Zero-Knowledge (Q2891503) (← links)
- Black-Box Constructions of Composable Protocols without Set-Up (Q2914276) (← links)
- Crowd-Blending Privacy (Q2914279) (← links)
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives (Q2914296) (← links)
- Local zero knowledge (Q2931395) (← links)
