Search results for "round-complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
98	Tzafrir Cohen, Joe Kilian, Erez Petrank	Responsive Round Complexity and Concurrent Zero-Knowledge.	ASIACRYPT	2001	DBLP DOI BibTeX RDF	cryptographic protocols, Zero-knowledge, concurrent zero-knowledge
57	Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin	The round complexity of verifiable secret sharing and secure multicast.	STOC	2001	DBLP DOI BibTeX RDF
56	Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan	The Round Complexity of Verifiable Secret Sharing Revisited.	CRYPTO	2009	DBLP DOI BibTeX RDF
54	Giuseppe Persiano, Ivan Visconti	On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model.	MFCS	2006	DBLP DOI BibTeX RDF
54	Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin	On 2-Round Secure Multiparty Computation.	CRYPTO	2002	DBLP DOI BibTeX RDF	lower bounds, Secure multiparty computation, round complexity
52	Vipul Goyal, Abhishek Jain 0002	On the round complexity of covert computation.	STOC	2010	DBLP DOI BibTeX RDF	covert computation, cryptography, round complexity
52	Giovanni Di Crescenzo	Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model.	COCOON	2009	DBLP DOI BibTeX RDF	Bare Public-Key Model, Complexity Assumptions, Round Complexity, Zero-Knowledge Protocols, Concurrent Zero-Knowledge
44	Jonathan Katz, Chiu-Yuen Koo	Round-Efficient Secure Computation in Point-to-Point Networks.	EUROCRYPT	2007	DBLP DOI BibTeX RDF
37	Huijia Lin, Rafael Pass	Non-malleability amplification.	STOC	2009	DBLP DOI BibTeX RDF	cryptography, commitment, non-malleability, round complexity
36	Omer Horvitz, Jonathan Katz	Universally-Composable Two-Party Computation in Two Rounds.	CRYPTO	2007	DBLP DOI BibTeX RDF
35	D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan	Brief announcement: on the round complexity of distributed consensus over synchronous networks.	PODC	2004	DBLP DOI BibTeX RDF	consensus, round complexity
35	Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev 0001	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.	FOCS	2007	DBLP DOI BibTeX RDF
34	Taisuke Izumi, Tomoko Izumi, Sayaka Kamei, Fukuhito Ooshita	Randomized Gathering of Mobile Robots with Local-Multiplicity Detection.	SSS	2009	DBLP DOI BibTeX RDF
34	Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan	Improving the Round Complexity of VSS in Point-to-Point Networks.	ICALP (2)	2008	DBLP DOI BibTeX RDF
34	Saurabh Sanghvi, Salil P. Vadhan	The round complexity of two-party random selection.	STOC	2005	DBLP DOI BibTeX RDF	cryptography, distributed computing, coin-flipping
33	Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki	Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma.	CCS	2008	DBLP DOI BibTeX RDF	concurrent proofs of knowledge, equiocable homomorphic commitment, forking lemma, multisignatures
32	Jeong Ok Kwon, Kouichi Sakurai, Dong Hoon Lee 0001	Efficient Password-Authenticated Key Exchange for Three-Party Secure Against Undetectable On-Line Dictionary Attacks.	International Conference on Computational Science (1)	2006	DBLP DOI BibTeX RDF	mobile network security, Cryptography, dictionary attacks, password-authenticated key exchange, round complexity
32	Satoshi Hada, Toshiaki Tanaka	A Relationship between One-Wayness and Correlation Intractability.	Public Key Cryptography	1999	DBLP DOI BibTeX RDF	correlation intractability, zero-knowledge, One-way functions, random oracle, interactive proofs, round complexity
32	Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky	Round Complexity of Authenticated Broadcast with a Dishonest Majority.	FOCS	2007	DBLP DOI BibTeX RDF
29	Yehuda Lindell, Anna Lysyanskaya, Tal Rabin	Sequential composition of protocols without simultaneous termination.	PODC	2002	DBLP DOI BibTeX RDF
28	Masayuki Abe	Robust Distributed Multiplicaton with out Interaction.	CRYPTO	1999	DBLP DOI BibTeX RDF	Distributed Multiplication, Cramer-Shoup Cryptosystem, Multi-Party Computation, Round Complexity
28	Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan	Round-Optimal and Efficient Verifiable Secret Sharing.	TCC	2006	DBLP DOI BibTeX RDF
27	Daniele Micciancio, Scott Yilek	The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.	TCC	2008	DBLP DOI BibTeX RDF
27	Jonathan Katz, Rafail Ostrovsky, Adam D. Smith	Round Efficiency of Multi-party Computation with a Dishonest Majority.	EUROCRYPT	2003	DBLP DOI BibTeX RDF
25	Jonathan Katz, Rafail Ostrovsky	Round-Optimal Secure Two-Party Computation.	CRYPTO	2004	DBLP DOI BibTeX RDF
24	Alejandro Hevia	Universally Composable Simultaneous Broadcast.	SCN	2006	DBLP DOI BibTeX RDF
24	Joël Alwen, Giuseppe Persiano, Ivan Visconti	Impossibility and Feasibility Results for Zero Knowledge with Public Keys.	CRYPTO	2005	DBLP DOI BibTeX RDF
22	Stanislaw Jarecki, Jihye Kim, Gene Tsudik	Robust group key agreement using short broadcasts.	CCS	2007	DBLP DOI BibTeX RDF	fault tolerance, group key agreement
22	Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	Information Theoretic Security, Multiparty Computation, Error Probability
21	Jens Groth, Steve Lu 0001	Verifiable Shuffle of Large Size Ciphertexts.	Public Key Cryptography	2007	DBLP DOI BibTeX RDF	homomorphic commitment, honest verifier zero-knowledge, homomorphic encryption, Shuffle, mix-net
20	Hagit Attiya, Danny Hendler	Time and Space Lower Bounds for Implementations Using k-CAS.	IEEE Trans. Parallel Distributed Syst.	2010	DBLP DOI BibTeX RDF	Compare&swap (CAS), k-compare&swap (k-CAS), conditional synchronization primitives, queue, collect, stack, counter, round complexity
20	Xing-Lan Zhang	Authenticated Key Exchange Protocol in One-Round.	ICA3PP	2009	DBLP DOI BibTeX RDF	Diffie-Hellman key exchange, Authenticated key exchange, Forward secrecy, Round complexity
20	Rafael Pass, Alon Rosen	New and improved constructions of non-malleable cryptographic protocols.	STOC	2005	DBLP DOI BibTeX RDF	non black-box simulation, cryptography, zero-knowledge, non-malleability, round-complexity, man-in-the-middle
20	Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg	MST construction in O(log log n) communication rounds.	SPAA	2003	DBLP DOI BibTeX RDF	communication round complexity, sub-logarithmic protocols, minimum spanning tree
20	Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz	What Can Be Observed Locally?	DISC	2009	DBLP DOI BibTeX RDF
20	Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee	Improved Non-committing Encryption with Applications to Adaptively Secure Protocols.	ASIACRYPT	2009	DBLP DOI BibTeX RDF	adaptive corruption, non-committing encryption, public-key encryption, secure multi-party computation
20	Arpita Patra, Ashish Choudhary, C. Pandu Rangan	Round Efficient Unconditionally Secure Multiparty Computation Protocol.	INDOCRYPT	2008	DBLP DOI BibTeX RDF	Information Theoretic Security, Multiparty Computation
20	Hoeteck Wee	One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.	TCC	2007	DBLP DOI BibTeX RDF	Interactive hashing, statistically hiding commitments, black-box lower bounds
20	Rida A. Bazzi, Gil Neiger	Simplifying fault-tolerance: providing the abstraction of crash failures.	J. ACM	2001	DBLP DOI BibTeX RDF	fault-tolerance, translations, crash failures
20	Rida A. Bazzi, Gil Neiger	Simulating Crash Failures with Many Faulty Processors (Extended Abstract).	WDAG	1992	DBLP DOI BibTeX RDF
20	Maya Leshkowitz	Round Complexity Versus Randomness Complexity in Interactive Proofs.	Theory Comput.	2022	DBLP BibTeX RDF
20	Maya Leshkowitz	Round Complexity Versus Randomness Complexity in Interactive Proofs.	APPROX-RANDOM	2018	DBLP DOI BibTeX RDF
20	Maya Leshkowitz	Round Complexity Versus Randomness Complexity in Interactive Proofs.	Electron. Colloquium Comput. Complex.	2017	DBLP BibTeX RDF
20	Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan	On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.	J. ACM	2012	DBLP DOI BibTeX RDF
19	Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel	Constant-Round Oblivious Transfer in the Bounded Storage Model.	J. Cryptol.	2007	DBLP DOI BibTeX RDF
19	Taisuke Izumi, Koichi Wada 0001	On the Probabilistic Omission Adversary.	SSS	2007	DBLP DOI BibTeX RDF
17	Tal Moran, Moni Naor, Gil Segev 0001	An Optimally Fair Coin Toss.	TCC	2009	DBLP DOI BibTeX RDF
17	Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti	Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model.	ICALP (2)	2008	DBLP DOI BibTeX RDF	non-malleable zero knowledge, witness indistinguishability
17	Wei Gao 0007, Guilin Wang, Xueli Wang, Fei Li 0006	One-Round ID-Based Blind Signature Scheme without ROS Assumption.	Pairing	2008	DBLP DOI BibTeX RDF
17	Jonathan Katz	On achieving the "best of both worlds" in secure multiparty computation.	STOC	2007	DBLP DOI BibTeX RDF	secure computation
17	Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan	Fault-Tolerant Distributed Computing in Full-Information Networks.	FOCS	2006	DBLP DOI BibTeX RDF
17	Piotr Berman, Juan A. Garay, Kenneth J. Perry	Optimal Early Stopping in Distributed Consensus (Extended Abstract).	WDAG	1992	DBLP DOI BibTeX RDF
16	Amit Chakrabarti, Oded Regev 0001	An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching.	FOCS	2004	DBLP DOI BibTeX RDF
15	Weize Wang, Yi Kuang	CipherFormer: Efficient Transformer Private Inference with Low Round Complexity.	CoRR	2024	DBLP DOI BibTeX RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Statistical MPC with Optimal Resiliency.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
15	Guangkuo Liu, Ian George, Eric Chitambar	The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation.	Quantum	2023	DBLP DOI BibTeX RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Statistical MPC with Optimal Resiliency.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
15	Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri	On the Round Complexity of Asynchronous Crusader Agreement.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
15	Pengfei Wu, Jianting Ning, Xinyi Huang 0001, Joseph K. Liu	Differentially Oblivious Two-Party Pattern Matching With Sublinear Round Complexity.	IEEE Trans. Dependable Secur. Comput.	2023	DBLP DOI BibTeX RDF
15	Saikrishna Badrinarayanan, Peihan Miao 0001, Pratyay Mukherjee, Divya Ravi	On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.	TCC (2)	2023	DBLP DOI BibTeX RDF
15	Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen	Randomized Functions with High Round Complexity.	TCC (1)	2023	DBLP DOI BibTeX RDF
15	Karine Altisen, Pierre Corbineau, Stéphane Devismes	Certified Round Complexity of Self-Stabilizing Algorithms.	DISC	2023	DBLP DOI BibTeX RDF
15	Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri	On the Round Complexity of Asynchronous Crusader Agreement.	OPODIS	2023	DBLP DOI BibTeX RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Statistical MPC with Optimal Resiliency.	STOC	2023	DBLP DOI BibTeX RDF
15	Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky	On the Round Complexity of Randomized Byzantine Agreement.	J. Cryptol.	2022	DBLP DOI BibTeX RDF
15	Yi Deng 0002, Xinxuan Zhang	Knowledge Encryption and Its Applications to Simulatable Protocols With Low Round-Complexity.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
15	Mohammad Anagreh, Peeter Laud, Eero Vainikko	Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity.	ICISSP	2022	DBLP DOI BibTeX RDF
15	Yi Deng 0002, Xinxuan Zhang	Knowledge Encryption and Its Applications to Simulatable Protocols with Low Round-Complexity.	ASIACRYPT (3)	2022	DBLP DOI BibTeX RDF
15	Arpita Patra, Divya Ravi	On the Exact Round Complexity of Secure Three-Party Computation.	J. Cryptol.	2021	DBLP DOI BibTeX RDF
15	Orestis Chardouvelis, Giulio Malavolta	The Round Complexity of Quantum Zero-Knowledge.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
15	Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan	On the Round Complexity of Black-box Secure MPC.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
15	Saikrishna Badrinarayanan, Peihan Miao 0001, Pratyay Mukherjee, Divya Ravi	On the Round Complexity of Fully Secure Solitary MPC with Honest Majority.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
15	Zhenbin Yan 0001, Yi Deng 0002	Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity.	Comput. J.	2021	DBLP DOI BibTeX RDF
15	Orestis Chardouvelis, Giulio Malavolta	The Round Complexity of Quantum Zero-Knowledge.	TCC (1)	2021	DBLP DOI BibTeX RDF
15	James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma	On the Round Complexity of Secure Quantum Computation.	CRYPTO (1)	2021	DBLP DOI BibTeX RDF
15	Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan	On the Round Complexity of Black-Box Secure MPC.	CRYPTO (2)	2021	DBLP DOI BibTeX RDF
15	Daniele Friolo	New perspectives in multi-party computation: low round complexity from new assumptions, financial fairness and public verifiability.		2021	RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.	Electron. Colloquium Comput. Complex.	2020	DBLP BibTeX RDF
15	James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma	On The Round Complexity of Two-Party Quantum Computation.	CoRR	2020	DBLP BibTeX RDF
15	Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer	On the Round Complexity of the Shuffle Model.	CoRR	2020	DBLP BibTeX RDF
15	Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer	On the Round Complexity of the Shuffle Model.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	Arpita Patra, Divya Ravi, Swati Singla	On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	Linda Chen, Jun Wan	Reducing Round Complexity of Byzantine Broadcast.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	James Bartusek, Andrea Coladangelo, Dakshita Khurana, Fermi Ma	On The Round Complexity of Two-Party Quantum Computation.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain 0002	The Round Complexity of Secure Computation Against Covert Adversaries.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
15	Noah Golowich, Madhu Sudan 0001	Round Complexity of Common Randomness Generation: The Amortized Setting.	SODA	2020	DBLP DOI BibTeX RDF
15	Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer	On the Round Complexity of the Shuffle Model.	TCC (2)	2020	DBLP DOI BibTeX RDF
15	Benny Applebaum, Eliran Kachlon, Arpita Patra	The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency.	FOCS	2020	DBLP DOI BibTeX RDF
15	Arpita Patra, Divya Ravi, Swati Singla	On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation.	ASIACRYPT (3)	2020	DBLP DOI BibTeX RDF
15	Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain 0002	The Round Complexity of Secure Computation Against Covert Adversaries.	SCN	2020	DBLP DOI BibTeX RDF
15	Noah Golowich, Madhu Sudan 0001	Round Complexity of Common Randomness Generation: The Amortized Setting.	CoRR	2019	DBLP BibTeX RDF
15	Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky	On the Round Complexity of Randomized Byzantine Agreement.	CoRR	2019	DBLP BibTeX RDF
15	T.-H. Hubert Chan, Rafael Pass, Elaine Shi	Round Complexity of Byzantine Agreement, Revisited.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
15	Benny Applebaum, Zvika Brakerski, Rotem Tsabary	Degree 2 is Complete for the Round-Complexity of Malicious MPC.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
15	Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky	On the Round Complexity of Randomized Byzantine Agreement.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
15	Arpita Patra, Divya Ravi	Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
15	Zhenbin Yan 0001, Yi Deng 0002	Non-malleable Zero-Knowledge Arguments with Lower Round Complexity.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
15	Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, Alex Samorodnitsky	On the Round Complexity of Randomized Byzantine Agreement.	DISC	2019	DBLP DOI BibTeX RDF
15	Arpita Patra, Divya Ravi	Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation.	ASIACRYPT (1)	2019	DBLP DOI BibTeX RDF