The following pages link to Silvio Micali (Q417639):
Displaying 50 items.
- Collusive dominant-strategy truthfulness (Q417640) (← links)
- Perfect implementation (Q625041) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- (Q809535) (redirect page) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Two-way deterministic finite automata are exponentially more succinct than sweeping automata (Q1157965) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- On-line/off-line digital signatures (Q1912770) (← links)
- A secure protocol for the oblivious transfer. (Extended abstract) (Q1924198) (← links)
- Mechanism design with possibilistic beliefs (Q2253833) (← links)
- Collusion, efficiency, and dominant strategies (Q2357811) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- (Q2757241) (← links)
- (Q2778858) (← links)
- Mechanisms With Costly Knowledge (Q2800548) (← links)
- Auction Revenue in the General Spiteful-Utility Model (Q2800566) (← links)
- Mechanism design with approximate valuations (Q2826042) (← links)
- Crowdsourced Bayesian auctions (Q2826060) (← links)
- Local zero knowledge (Q2931395) (← links)
- On the Cryptographic Applications of Random Functions (Extended Abstract) (Q2974488) (← links)
- A “Paradoxical” Solution to The Signature Problem (Q2974497) (← links)
- (Q3149676) (← links)
- Resettable zero-knowledge (extended abstract) (Q3191990) (← links)
- (Q3197310) (← links)
- (Q3202944) (← links)
- (Q3210162) (← links)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289) (← links)
- (Q3374913) (← links)
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing (Q3452352) (← links)
- Collusion-free protocols (Q3581451) (← links)
- Independent Zero-Knowledge Sets (Q3591415) (← links)
- Purely Rational Secret Sharing (Extended Abstract) (Q3611758) (← links)
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (Q3718168) (← links)
- (Q3729902) (← links)
- (Q3773819) (← links)
- (Q3777937) (← links)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (Q3787914) (← links)
- The Notion of Security for Probabilistic Cryptosystems (Q3787915) (← links)
- (Q3789104) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Minimal forms in<i>λ</i>-cakulus computations (Q3897031) (← links)
- Noninteractive Zero-Knowledge (Q3985810) (← links)
- Removing Interaction from Zero-Knowledge Proofs (Q4206387) (← links)
- Lower Bounds for Oblivious Transfer Reductions (Q4250752) (← links)
- (Q4250776) (← links)
- (Q4279578) (← links)
- How to sign given any trapdoor permutation (Q4302825) (← links)
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems (Q4302852) (← links)
