The following pages link to Giovanni Di Crescenzo (Q166363):
Displaying 50 items.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- (Q1028418) (redirect page) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- Round-optimal perfect zero-knowledge proofs (Q1322120) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups (Q1662220) (← links)
- Zero-knowledge arguments and public-key cryptography (Q1898111) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- Cryptographic password obfuscation (Q2218973) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- Contemporary cryptology. (Q2386512) (← links)
- (Q2721175) (← links)
- (Q2754163) (← links)
- (Q2757259) (← links)
- (Q2757268) (← links)
- (Q2766853) (← links)
- Universal service-providers for database private information retrieval (extended abstract) (Q2790104) (← links)
- Security-preserving hardness-amplification for any regular one-way function (Q2819544) (← links)
- Secure Node Discovery in Ad-hoc Networks and Applications (Q2864180) (← links)
- Zero-Knowledge Proofs via Polynomial Representations (Q2912732) (← links)
- Combinatorial Group Testing for Corruption Localizing Hashing (Q3087984) (← links)
- Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy (Q3184764) (← links)
- On zero-knowledge proofs (extended abstract) (Q3191992) (← links)
- (Q3374904) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages (Q3395032) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge (Q3596756) (← links)
- (Q4249346) (← links)
- Conditional Oblivious Transfer and Timed-Release Encryption (Q4250755) (← links)
- (Q4251066) (← links)
- (Q4252397) (← links)
- (Q4258569) (← links)
- (Q4341734) (← links)
- (Q4341776) (← links)
- (Q4364541) (← links)
- (Q4365736) (← links)
- (Q4373608) (← links)
- (Q4381399) (← links)
- (Q4414269) (← links)
- (Q4414273) (← links)
- (Q4440437) (← links)
- (Q4448385) (← links)
- (Q4536288) (← links)
- (Q4542531) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
