Остановите войну!
for scientists:
default search action
Alfredo De Santis
- > Home > Persons > Alfredo De Santis
Publications
- 2008
- [j71]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung:
On Monotone Formula Composition of Perfect Zero-Knowledge Languages. SIAM J. Comput. 38(4): 1300-1329 (2008) - 2004
- [c44]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge. MFCS 2004: 356-367 - 2002
- [c40]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Randomness-Optimal Characterization of Two NP Proof Systems. RANDOM 2002: 179-193 - 2001
- [c38]Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai:
Robust Non-interactive Zero Knowledge. CRYPTO 2001: 566-598 - 2000
- [c35]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations. ICALP 2000: 451-462 - 1999
- [j39]Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. Inf. Process. Lett. 69(4): 201-206 (1999) - [c33]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. ICALP 1999: 271-280 - 1998
- [c32]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Communication-Efficient Anonymous Group Identification. CCS 1998: 73-82 - [c31]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung:
Image Density is Complete for Non-Interactive-SZK (Extended Abstract). ICALP 1998: 784-795 - [i4]Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. Electron. Colloquium Comput. Complex. TR98 (1998) - [i3]Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. IACR Cryptol. ePrint Arch. 1998: 2 (1998) - 1997
- [c30]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). ICALP 1997: 716-726 - 1995
- [j16]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Zero-Knowledge Arguments and Public-Key Cryptography. Inf. Comput. 121(1): 23-40 (1995) - 1994
- [j12]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
The Knowledge Complexity of Quadratic Residuosity Languages. Theor. Comput. Sci. 132(2): 291-317 (1994) - [c26]Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo, Antonio Giorgio Gaggia, Ugo Vaccaro:
Multi-Secret Sharing Schemes. CRYPTO 1994: 150-163 - [c25]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung:
On Monotone Formula Closure of SZK. FOCS 1994: 454-465 - 1993
- [c22]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano:
Secret Sharing and Perfect Zero Knowledge. CRYPTO 1993: 73-84
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint