default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVarun Narayanan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Damiano Abram
, Jack Doerner, Yuval Ishai, Varun Narayanan:
Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output. EUROCRYPT (5) 2024: 122-154- [c18]Varun Narayanan, Shubham Vivek Pawar, Akshayaram Srinivasan:
Secure Computation with Parallel Calls to 2-Ary Functions. TCC (4) 2024: 234-265 - [c17]Giovanni Deligios, Anders Konring, Chen-Da Liu-Zhang, Varun Narayanan:
Statistical Layered MPC. TCC (4) 2024: 362-394 - [i17]Hari Krishnan P. Anilkumar, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Randomness in Private Sequential Stateless Protocols. IACR Cryptol. ePrint Arch. 2024: 1448 (2024) - [i16]Giovanni Deligios, Anders Konring, Chen-Da Liu-Zhang, Varun Narayanan:
Statistical Layered MPC. IACR Cryptol. ePrint Arch. 2024: 1670 (2024) - [i15]Varun Narayanan, Shubham Vivek Pawar, Akshayaram Srinivasan:
Secure Computation with Parallel Calls to 2-ary Functions. IACR Cryptol. ePrint Arch. 2024: 1701 (2024) - [i14]Tamar Ben David, Varun Narayanan, Olga Nissenbaum, Anat Paskin-Cherniavsky:
New results in Share Conversion, with applications to evolving access structures. IACR Cryptol. ePrint Arch. 2024: 1781 (2024) - 2023
- [c16]Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - [c15]Yuval Ishai, Mahimna Kelkar, Varun Narayanan, Liav Zafar:
One-Message Secure Reductions: On the Cost of Converting Correlations. CRYPTO (1) 2023: 515-547 - [c14]Varun Narayanan, Vinod M. Prabhakaran, Neha Sangwan, Shun Watanabe:
Complete Characterization of Broadcast and Pseudo-signatures from Correlations. EUROCRYPT (2) 2023: 563-593 - [c13]Varun Narayanan, Sriram Sankaran:
Electromagnetic Fault Injection Attack on ASCON Using ChipShouter. IFIPIoT (1) 2023: 114-131 - [c12]Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan, Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Randomness Requirements for Three-Secret Sharing. ISIT 2023: 252-257 - [c11]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. TCC (1) 2023: 286-315 - [i13]Hari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan, Manoj M. Prabhakaran, Vinod M. Prabhakaran:
Randomness Requirements for Three-Secret Sharing. CoRR abs/2304.14934 (2023) - [i12]Varun Narayanan, Vinod M. Prabhakaran, Neha Sangwan, Shun Watanabe:
Complete Characterization of Broadcast and Pseudo-Signatures from Correlations. IACR Cryptol. ePrint Arch. 2023: 233 (2023) - [i11]Bernardo David, Anders Konring, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Perfect MPC over Layered Graphs. IACR Cryptol. ePrint Arch. 2023: 330 (2023) - [i10]Yuval Ishai, Mahimna Kelkar, Varun Narayanan, Liav Zafar:
One-Message Secure Reductions: On the Cost of Converting Correlations. IACR Cryptol. ePrint Arch. 2023: 1225 (2023) - [i9]Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. IACR Cryptol. ePrint Arch. 2023: 1929 (2023) - 2022
- [j1]Varun Narayanan, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, Vinod M. Prabhakaran:
Private Index Coding. IEEE Trans. Inf. Theory 68(3): 2020-2049 (2022) - [c10]Pratyush Agarwal, Varun Narayanan, Shreya Pathak, Manoj Prabhakaran, Vinod M. Prabhakaran, Mohammad Ali Rehan:
Secure Non-interactive Reduction and Spectral Analysis of Correlations. EUROCRYPT (3) 2022: 797-827 - [c9]Neha Sangwan, Varun Narayanan, Vinod M. Prabhakaran:
Byzantine Consensus Over Broadcast Channels. ISIT 2022: 1157-1162 - [c8]Saumya Goyal, Varun Narayanan, Manoj Prabhakaran:
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions. TCC (3) 2022: 89-118 - [c7]Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-interactive Reducibility is Decidable. TCC (2) 2022: 408-437 - [i8]Neha Sangwan, Varun Narayanan, Vinod M. Prabhakaran:
Consensus Capacity of Noisy Broadcast Channels. CoRR abs/2205.06073 (2022) - [i7]Pratyush Agarwal, Varun Narayanan, Shreya Pathak, Manoj Prabhakaran, Vinod M. Prabhakaran, Mohammad Ali Rehan:
Secure Non-Interactive Reduction and Spectral Analysis of Correlations. IACR Cryptol. ePrint Arch. 2022: 262 (2022) - [i6]Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-Interactive Reducibility is Decidable. IACR Cryptol. ePrint Arch. 2022: 1457 (2022) - [i5]Saumya Goyal, Varun Narayanan, Manoj Prabhakaran:
Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions. IACR Cryptol. ePrint Arch. 2022: 1539 (2022) - 2021
- [c6]Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen:
Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. CRYPTO (2) 2021: 124-154 - 2020
- [c5]Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen:
Cryptography from One-Way Communication: On Completeness of Finite Channels. ASIACRYPT (3) 2020: 653-685 - [c4]Varun Narayanan, Manoj Mishra, Vinod M. Prabhakaran:
Private Two-Terminal Hypothesis Testing. ISIT 2020: 1001-1006 - [c3]Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Zero-Communication Reductions. TCC (3) 2020: 274-304 - [i4]Varun Narayanan, Manoj Mishra, Vinod M. Prabhakaran:
Private Two-Terminal Hypothesis Testing. CoRR abs/2005.05961 (2020) - [i3]Varun Narayanan, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani, Vinod M. Prabhakaran:
Private Index Coding. CoRR abs/2006.00257 (2020) - [i2]Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran:
Zero-Communication Reductions. IACR Cryptol. ePrint Arch. 2020: 1341 (2020)
2010 – 2019
- 2018
- [c2]Varun Narayanan, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani:
Private Index Coding. ISIT 2018: 596-600 - [c1]Varun Narayanan, Vinod M. Prabhakaran:
Oblivious Transfer in Incomplete Networks. TCC (1) 2018: 389-418 - [i1]Varun Narayanan, Vinod M. Prabhakaran:
Oblivious Transfer in Incomplete Networks. IACR Cryptol. ePrint Arch. 2018: 875 (2018)
Coauthor Index
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-12-13 20:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
