Search results for "round-complexity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Benny Applebaum, Zvika Brakerski, Rotem Tsabary	Degree 2 is Complete for the Round-Complexity of Malicious MPC.	EUROCRYPT (2)	2019	DBLP DOI BibTeX RDF
15	Sepehr Assadi, Sanjeev Khanna	Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.	CoRR	2018	DBLP BibTeX RDF
15	Arpita Patra, Divya Ravi	On the Exact Round Complexity of Secure Three-Party Computation.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF
15	Sepehr Assadi, Sanjeev Khanna	Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem.	SODA	2018	DBLP DOI BibTeX RDF
15	Arpita Patra, Divya Ravi	On the Exact Round Complexity of Secure Three-Party Computation.	CRYPTO (2)	2018	DBLP DOI BibTeX RDF
15	Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler	On the Round Complexity of OT Extension.	CRYPTO (3)	2018	DBLP DOI BibTeX RDF
15	Sanjam Garg, Susumu Kiyoshima, Omkant Pandey	On the Exact Round Complexity of Self-Composable Two-Party Computation.	IACR Cryptol. ePrint Arch.	2017	DBLP BibTeX RDF
15	Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler	On the Round Complexity of OT Extension.	IACR Cryptol. ePrint Arch.	2017	DBLP BibTeX RDF
15	Amisha Jhanji, Hemanta K. Maji, Raphael Arkady Meyer	Characterizing optimal security and round-complexity for secure OR evaluation.	ISIT	2017	DBLP DOI BibTeX RDF
15	Sanjam Garg, Susumu Kiyoshima, Omkant Pandey	On the Exact Round Complexity of Self-composable Two-Party Computation.	EUROCRYPT (2)	2017	DBLP DOI BibTeX RDF
15	Aishwarya Thiruvengadam	Improving the Round Complexity of Ideal-Cipher Constructions.		2017	RDF
15	Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou	The Exact Round Complexity of Secure Computation.	IACR Cryptol. ePrint Arch.	2016	DBLP BibTeX RDF
15	Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou	The Exact Round Complexity of Secure Computation.	EUROCRYPT (2)	2016	DBLP DOI BibTeX RDF
15	Chaya Ganesh, Arpita Patra	Broadcast Extensions with Optimal Communication and Round Complexity.	PODC	2016	DBLP DOI BibTeX RDF
15	Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila	The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.	COCOON	2016	DBLP DOI BibTeX RDF
15	Fei Li 0006, Dongqing Xie, Wei Gao 0007, Xu An Wang 0001, Jianhua Yan	An ID-based Dynamic Authenticated Group Key Agreement Scheme with Optimal Round Complexity from Pairings.	CISIS	2016	DBLP DOI BibTeX RDF
15	Shailesh Vaya	Round complexity of leader election and gossiping in bidirectional radio networks.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
15		The Round Complexity of Small Set Intersection	CoRR	2013	DBLP BibTeX RDF
15	Ashish Choudhury, Kaoru Kurosawa, Arpita Patra	The Round Complexity of Perfectly Secure General VSS.	ICITS	2011	DBLP DOI BibTeX RDF
15	Boaz Patt-Shamir, Marat Teplitsky	The round complexity of distributed sorting: extended abstract.	PODC	2011	DBLP DOI BibTeX RDF
15	Ashish Choudhury, Kaoru Kurosawa, Arpita Patra	The Round Complexity of General VSS.	IACR Cryptol. ePrint Arch.	2010	DBLP BibTeX RDF
15	Vipul Goyal, Abhishek Jain 0002	On the Round Complexity of Covert Computation.	IACR Cryptol. ePrint Arch.	2010	DBLP BibTeX RDF
15	Huafei Zhu, Feng Bao 0001	Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity.	Inscrypt	2010	DBLP DOI BibTeX RDF
15	Aggelos Kiayias, Serdar Pehlivanoglu	Improving the Round Complexity of Traitor Tracing Schemes.	ACNS	2010	DBLP DOI BibTeX RDF
15	Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan	The Round Complexity of Verifiable Secret Sharing: The Statistical Case.	ASIACRYPT	2010	DBLP DOI BibTeX RDF
15	S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich	On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations.	LATINCRYPT	2010	DBLP DOI BibTeX RDF
15	Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan	Improving the round complexity of VSS in point-to-point networks.	Inf. Comput.	2009	DBLP DOI BibTeX RDF
15	Michael Okun	On the round complexity of Byzantine agreement without initial set-up.	Inf. Comput.	2009	DBLP DOI BibTeX RDF
15	Lior Malka	Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs.	Electron. Colloquium Comput. Complex.	2008	DBLP BibTeX RDF
15	Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan	The Round Complexity of Verifiable Secret Sharing Revisited.	IACR Cryptol. ePrint Arch.	2008	DBLP BibTeX RDF
15	Saurabh Sanghvi, Salil P. Vadhan	The Round Complexity of Two-Party Random Selection.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
15	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.	Electron. Colloquium Comput. Complex.	2007	DBLP BibTeX RDF
15	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.	IACR Cryptol. ePrint Arch.	2007	DBLP BibTeX RDF
15	Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan	Improving the Round Complexity of VSS in Point-to-Point Networks.	IACR Cryptol. ePrint Arch.	2007	DBLP BibTeX RDF
15	Saurabh Sanghvi, Salil P. Vadhan	The Round Complexity of Two-Party Random Selection	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
15	Manoj Prabhakaran 0001, Amit Sahai	Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity.	IACR Cryptol. ePrint Arch.	2002	DBLP BibTeX RDF
15	Manoj Prabhakaran 0001, Alon Rosen, Amit Sahai	Concurrent Zero Knowledge with Logarithmic Round-Complexity.	FOCS	2002	DBLP DOI BibTeX RDF
15	Yuji Watanabe, Hideki Imai	Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP.	CCS	2000	DBLP DOI BibTeX RDF
15	Alon Rosen	A Note on the Round-Complexity of Concurrent Zero-Knowledge.	CRYPTO	2000	DBLP DOI BibTeX RDF
15	Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung	Zero-knowledge proofs of decision power: new protocols and optimal round-complexity.	ICICS	1997	DBLP DOI BibTeX RDF
15	Ofer Biran, Shlomo Moran, Shmuel Zaks	Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.	Theor. Comput. Sci.	1995	DBLP DOI BibTeX RDF
15	Ofer Biran, Shlomo Moran, Shmuel Zaks	Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.	WDAG	1990	DBLP DOI BibTeX RDF
15	Donald Beaver, Silvio Micali, Phillip Rogaway	The Round Complexity of Secure Protocols (Extended Abstract)	STOC	1990	DBLP DOI BibTeX RDF
15	Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin	Secure Linear Algebra Using Linearly Recurrent Sequences.	TCC	2007	DBLP DOI BibTeX RDF	Secure Linear Algebra, Linearly Recurrent Sequences, Wiedemann’s Algorithm
15	Junghyun Nam, Juryon Paik, Ung-Mo Kim, Dongho Won	Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity.	ACNS	2007	DBLP DOI BibTeX RDF	nonce-chained authentication, scalability, Cryptography, provable security, binary tree, group key exchange
15	Shaoquan Jiang, Guang Gong	A Round and Communication Efficient Secure Ranking Protocol.	CT-RSA	2006	DBLP DOI BibTeX RDF
15	Dowon Hong, Ku-Young Chang, Heuisu Ryu	Efficient Oblivious Transfer in the Bounded-Storage Model.	ASIACRYPT	2002	DBLP DOI BibTeX RDF
13	Fabien Mathieu	Upper Bounds for Stabilization in Acyclic Preference-Based Systems.	SSS	2007	DBLP DOI BibTeX RDF	Preference-based systems, adversarial and round robin daemons, round robin, acyclicity, b-matching
13	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations
13	Maurizio Adriano Strangio	An Optimal Round Two-Party Password-Authenticated Key Agreement Protocol.	ARES	2006	DBLP DOI BibTeX RDF
13	Amos Beimel, Lior Malka	Efficient reliable communication over partially authenticated networks.	Distributed Comput.	2005	DBLP DOI BibTeX RDF	Incomplete networks, Fault tolerance, Authentication, Reliable communication
13	Shaoquan Jiang, Guang Gong	Efficient Authenticators with Application to Key Exchange.	ICISC	2005	DBLP DOI BibTeX RDF
13	Amos Beimel, Lior Malka	Efficient reliable communication over partially authenticated networks.	PODC	2003	DBLP DOI BibTeX RDF
13	Olaf Müller, Michael Nüsken	Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System.	INDOCRYPT	2002	DBLP DOI BibTeX RDF
13	Joe Kilian, Erez Petrank	Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.	STOC	2001	DBLP DOI BibTeX RDF
12	Giuseppe Persiano, Ivan Visconti	Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds.	ICALP	2005	DBLP DOI BibTeX RDF
12	Rafael Pass	Bounded-concurrent secure multi-party computation with a dishonest majority.	STOC	2004	DBLP DOI BibTeX RDF	constant-round protocols, simulation-sound zero-knowledge, secure multi-party computation, concurrent composition
12	Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin	Secure Applications of Pedersen's Distributed Key Generation Protocol.	CT-RSA	2003	DBLP DOI BibTeX RDF	distributed key generation, discrete logarithm, random oracle model, Threshold cryptography, exact security
12	Ivan Damgård, Oded Goldreich 0001, Tatsuaki Okamoto, Avi Wigderson	Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs.	CRYPTO	1995	DBLP DOI BibTeX RDF
11	Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers	Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.	ISAAC	2009	DBLP DOI BibTeX RDF
10	Harry Buhrman, Michal Koucký 0001, Nikolai K. Vereshchagin	Randomised Individual Communication Complexity.	CCC	2008	DBLP DOI BibTeX RDF	individual communication complexity, Kolmogorov complexity, rounds, randomized protocols
10	Ronen Gradwohl, Salil P. Vadhan, David Zuckerman	Random Selection with an Adversarial Majority.	CRYPTO	2006	DBLP DOI BibTeX RDF
10	David P. Woodruff, Jessica Staddon	Private inference control.	CCS	2004	DBLP DOI BibTeX RDF	oblivious transfer, private information retrieval, inference control
8	Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi	Essentially Optimal Universally Composable Oblivious Transfer.	ICISC	2008	DBLP DOI BibTeX RDF	Oblivious Transfer, Universally Composable Security
8	Jin Yuan, Qingsong Ye, Huaxiong Wang, Josef Pieprzyk	Secure Computation of the Vector Dominance Problem.	ISPEC	2008	DBLP DOI BibTeX RDF
8	Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski	Randomized leader election.	Distributed Comput.	2007	DBLP DOI BibTeX RDF
8	Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi, Anand Srinivasan	Efficient gossip-based aggregate computation.	PODS	2006	DBLP DOI BibTeX RDF
8	Seth Gilbert, Rachid Guerraoui, Calvin C. Newport	Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks.	OPODIS	2006	DBLP DOI BibTeX RDF
8	Marc Fischlin	Round-Optimal Composable Blind Signatures in the Common Reference String Model.	CRYPTO	2006	DBLP DOI BibTeX RDF
8	Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth	Dynamic and self-stabilizing distributed matching.	PODC	2002	DBLP DOI BibTeX RDF
8	Silvio Micali, Leonid Reyzin	Soundness in the Public-Key Model.	CRYPTO	2001	DBLP DOI BibTeX RDF
7	S. Dov Gordon, Jonathan Katz	Complete Fairness in Multi-party Computation without an Honest Majority.	TCC	2009	DBLP DOI BibTeX RDF
7	Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee	Simple, Black-Box Constructions of Adaptively Secure Protocols.	TCC	2009	DBLP DOI BibTeX RDF
7	Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam	A unified framework for concurrent security: universal composability from stand-alone non-malleability.	STOC	2009	DBLP DOI BibTeX RDF	secure multi-party computation, universal composability, non-malleability
7	Felix Brandt 0001, Tuomas Sandholm	On the Existence of Unconditionally Privacy-Preserving Auction Protocols.	ACM Trans. Inf. Syst. Secur.	2008	DBLP DOI BibTeX RDF	auctions, multiparty computation
7	Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling, Huaxiong Wang	Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.	ASIACRYPT	2008	DBLP DOI BibTeX RDF	strongly multiplicative linear secret sharing scheme, secure multi-party computation, monotone span program
7	Indranil Saha, Debapriyay Mukhopadhyay	A Distributed Algorithm of Fault Recovery for Stateful Failover.	TAMC	2007	DBLP DOI BibTeX RDF	stateful failover, verification of programs, distributed algorithm, SPIN model checker
7	Su-Mi Lee, Su Youn Lee, Dong Hoon Lee 0001	Efficient Group Key Agreement for Dynamic TETRA Networks.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
7	Jonathan Katz, Ji Sun Shin	Parallel and Concurrent Security of the HB and HB+ Protocols.	EUROCRYPT	2006	DBLP DOI BibTeX RDF
7	Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan	Byzantine agreement in the full-information model in O(log n) rounds.	STOC	2006	DBLP DOI BibTeX RDF	full-information model, byzantine agreement
7	Salil P. Vadhan	An Unconditional Study of Computational Zero Knowledge.	FOCS	2004	DBLP DOI BibTeX RDF
7	Rosario Gennaro	Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks.	CRYPTO	2004	DBLP DOI BibTeX RDF
7	Felix Brandt 0001, Tuomas Sandholm	Im)Possibility of Unconditionally Privacy-Preserving Auctions.	AAMAS	2004	DBLP DOI BibTeX RDF
7	Rafael Pass, Alon Rosen	Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.	FOCS	2003	DBLP DOI BibTeX RDF
7	Anderson C. A. Nascimento, Jörn Müller-Quade, Akira Otsuka, Goichiro Hanaoka, Hideki Imai	Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations.	ISC	2003	DBLP DOI BibTeX RDF
7	Ted Herman, Toshimitsu Masuzawa	Self-Stabilizing Agent Traversal.	WSS	2001	DBLP DOI BibTeX RDF
7	Kazumasa Omote, Atsuko Miyaji	An Anonymous Aution Protocol with a Single Non-trusted Center Using Binary Trees.	ISW	2000	DBLP DOI BibTeX RDF
7	Yevgeniy Dodis, Silvio Micali	Parallel Reducibility for Information-Theoretically Secure Computation.	CRYPTO	2000	DBLP DOI BibTeX RDF
7	Miyako Ohkubo, Fumiaki Miura, Masayuki Abe, Atsushi Fujioka, Tatsuaki Okamoto	An Improvement on a Practical Secret Voting Scheme.	ISW	1999	DBLP DOI BibTeX RDF
7	Kazue Sako, Joe Kilian	Secure Voting Using Partially Compatible Homomorphisms.	CRYPTO	1994	DBLP DOI BibTeX RDF
7	Toshiya Itoh, Kouichi Sakurai	On the Complexity of Constant Round ZKIP of Possession of Knowledge.	ASIACRYPT	1991	DBLP DOI BibTeX RDF