Giovanni Di Crescenzo

From MaRDI portal
Revision as of 15:42, 7 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Giovanni Di Crescenzo to Giovanni Di Crescenzo: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:166363

Available identifiers

zbMath Open di-crescenzo.giovanniWikidataQ112315994 ScholiaQ112315994MaRDI QIDQ166363

List of research outcomes





PublicationDate of PublicationType
A survey on delegated computation2022-08-11Paper
Towards a Theory of Intrusion Detection2022-03-09Paper
Delegating a product of group exponentiations with application to signature schemes2021-05-12Paper
Secure and efficient delegation of elliptic-curve pairing2021-02-23Paper
Cryptographic password obfuscation2021-01-18Paper
Efficient and secure delegation of exponentiation in general groups to a single malicious server2020-10-30Paper
Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups2018-08-17Paper
Randomness-efficient non-interactive zero knowledge2018-07-04Paper
https://portal.mardi4nfdi.de/entity/Q52714262017-07-11Paper
Security-preserving hardness-amplification for any regular one-way function2016-09-29Paper
The graph clustering problem has a perfect zero-knowledge interactive proof2016-06-16Paper
Universal service-providers for database private information retrieval (extended abstract)2016-03-02Paper
On zero-knowledge proofs (extended abstract)2014-09-26Paper
Secure Node Discovery in Ad-hoc Networks and Applications2013-12-06Paper
Zero-Knowledge Proofs via Polynomial Representations2012-09-25Paper
Combinatorial Group Testing for Corruption Localizing Hashing2011-08-17Paper
On server trust in private proxy auctions2010-11-30Paper
Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy2009-10-22Paper
On Monotone Formula Composition of Perfect Zero-Knowledge Languages2009-08-20Paper
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model2009-08-18Paper
Algorithms and Computation2009-08-07Paper
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model2009-07-23Paper
Hypergraph decomposition and secret sharing2009-06-30Paper
3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge2009-01-29Paper
On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries2009-01-22Paper
Succinct NP Proofs from an Extractability Assumption2008-06-19Paper
Public Key Encryption with Searchable Keywords Based on Jacobi Symbols2008-04-11Paper
Advances in Cryptology - EUROCRYPT 20042007-09-25Paper
Theory of Cryptography2007-02-12Paper
Information Security and Cryptology2006-11-14Paper
Security in Communication Networks2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54890602006-09-25Paper
https://portal.mardi4nfdi.de/entity/Q33749042006-03-01Paper
Automata, Languages and Programming2006-01-10Paper
Automata, Languages and Programming2006-01-10Paper
Financial Cryptography and Data Security2005-12-22Paper
Contemporary cryptology.2005-08-30Paper
Advances in Cryptology – CRYPTO 20042005-08-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47395222004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q42523972004-03-09Paper
https://portal.mardi4nfdi.de/entity/Q44483852004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44404372003-12-17Paper
Sharing one secret vs. sharing many secrets.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44142692003-07-24Paper
https://portal.mardi4nfdi.de/entity/Q44142732003-07-24Paper
https://portal.mardi4nfdi.de/entity/Q47837452002-12-08Paper
https://portal.mardi4nfdi.de/entity/Q45362882002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q47791522002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45425312002-08-01Paper
https://portal.mardi4nfdi.de/entity/Q27668532002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q27541632001-12-06Paper
https://portal.mardi4nfdi.de/entity/Q27572592001-11-25Paper
https://portal.mardi4nfdi.de/entity/Q27572682001-11-25Paper
https://portal.mardi4nfdi.de/entity/Q27211752001-07-01Paper
Universal service-providers for private information retrieval2001-05-13Paper
https://portal.mardi4nfdi.de/entity/Q49526272000-10-23Paper
https://portal.mardi4nfdi.de/entity/Q49418752000-08-27Paper
https://portal.mardi4nfdi.de/entity/Q49406932000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49386302000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42585691999-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42493461999-06-17Paper
Conditional Oblivious Transfer and Timed-Release Encryption1999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42510661999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43813991999-01-10Paper
https://portal.mardi4nfdi.de/entity/Q43736081998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43645411998-02-10Paper
https://portal.mardi4nfdi.de/entity/Q43657361998-01-29Paper
https://portal.mardi4nfdi.de/entity/Q43417761997-10-06Paper
https://portal.mardi4nfdi.de/entity/Q43417341997-07-20Paper
Zero-knowledge arguments and public-key cryptography1995-11-05Paper
The knowledge complexity of quadratic residuosity languages1994-09-25Paper
Round-optimal perfect zero-knowledge proofs1994-05-05Paper

Research outcomes over time

This page was built for person: Giovanni Di Crescenzo