Search results for "constant-round"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
81	Yehuda Lindell	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.	J. Cryptol.	2003	DBLP DOI BibTeX RDF	Constant-round protocols, Coin-tossing, Secure computation
57	Boaz Barak, Yehuda Lindell	Strict polynomial-time in simulation and extraction.	STOC	2002	DBLP DOI BibTeX RDF
55	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	Yehuda Lindell	Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation.	CRYPTO	2001	DBLP DOI BibTeX RDF
46	Boaz Barak	Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model.	FOCS	2002	DBLP DOI BibTeX RDF
44	Ronald Cramer, Ivan Damgård	Secure Distributed Linear Algebra in a Constant Number of Rounds.	CRYPTO	2001	DBLP DOI BibTeX RDF
43	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
43	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
43	Carlo Blundo, Clemente Galdi, Pino Persiano	Randomness Recycling in Constant-Round Private Computations (extended Abstract).	DISC	1999	DBLP DOI BibTeX RDF
40	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
40	Carlo Blundo, Clemente Galdi, Giuseppe Persiano	Low-randomness constant-round private XOR computations.	Int. J. Inf. Sec.	2007	DBLP DOI BibTeX RDF	Randomness, Multiparty computation
40	Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti	Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model.	CRYPTO	2004	DBLP DOI BibTeX RDF
38	Jonathan Katz, Chiu-Yuen Koo	On Expected Constant-Round Protocols for Byzantine Agreement.	CRYPTO	2006	DBLP DOI BibTeX RDF
38	Yuval Ishai, Eyal Kushilevitz	Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials.	ICALP	2002	DBLP DOI BibTeX RDF
36	Rafael Pass, Hoeteck Wee	Black-Box Constructions of Two-Party Protocols from One-Way Functions.	TCC	2009	DBLP DOI BibTeX RDF	black-box constructions, zero-knowledge arguments, trapdoor commitments, parallel coin-tossing, non-malleable commitments, secure two-party computation
35	Jun Furukawa 0001, Kaoru Kurosawa, Hideki Imai	An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge.	ICALP (2)	2006	DBLP DOI BibTeX RDF	constant-round, resettable zero-knowledge, the random oracle model, resettably-sound argument of knowledge, ?-protocol, efficient, deniable
35	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
35	Jin Wook Byun, Su-Mi Lee, Dong Hoon Lee 0001, Dowon Hong	Constant-Round Password-Based Group Key Generation for Multi-layer Ad-Hoc Networks.	SPC	2006	DBLP DOI BibTeX RDF	multi-layer ad-hoc network, pervasive computing, heterogeneous, key agreement, Password authentication, authenticated key exchange
35	Ivan Damgård, Yuval Ishai	Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator.	CRYPTO	2005	DBLP DOI BibTeX RDF
32	Yehuda Lindell, Anna Lysyanskaya, Tal Rabin	Sequential composition of protocols without simultaneous termination.	PODC	2002	DBLP DOI BibTeX RDF
32	Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung	Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols.	STACS	1998	DBLP DOI BibTeX RDF
30	Stanislaw Jarecki, Jihye Kim, Gene Tsudik	Robust group key agreement using short broadcasts.	CCS	2007	DBLP DOI BibTeX RDF	fault tolerance, group key agreement
30	Giovanni Di Crescenzo, Ivan Visconti	Concurrent Zero Knowledge in the Public-Key Model.	ICALP	2005	DBLP DOI BibTeX RDF
30	Shuhua Wu, Yuefei Zhu	Constant-Round Password-Based Authenticated Key Exchange Protocol for Dynamic Groups.	Financial Cryptography	2008	DBLP DOI BibTeX RDF	provably secure, key exchange, password authenticated, dynamic group
28	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
27	Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee	Inaccessible entropy.	STOC	2009	DBLP DOI BibTeX RDF	interactive hashing, computational complexity, cryptography, zero knowledge, one-way functions, commitment schemes
27	Alejandro Hevia	Universally Composable Simultaneous Broadcast.	SCN	2006	DBLP DOI BibTeX RDF
27	Boaz Barak, Yehuda Lindell, Salil P. Vadhan	Lower Bounds for Non-Black-Box Zero Knowledge.	FOCS	2003	DBLP DOI BibTeX RDF
27	Satoshi Hada	Zero-Knowledge and Code Obfuscation.	ASIACRYPT	2000	DBLP DOI BibTeX RDF
27	Iftach Haitner, Mohammad Mahmoody, David Xiao	A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.	CCC	2010	DBLP DOI BibTeX RDF	sampling protocols, constant-round statistically hiding commitments, black-box lower bounds, collision-resistant hash functions
27	Oded Goldreich 0001, Erez Petrank	Quantifying Knowledge Complexity	FOCS	1991	DBLP DOI BibTeX RDF	constant round AM proofs, knowledge complexity, inclusion results, separation results, Hint sense, computational complexity, languages, proof system
27	Rafael Pass, Muthuramakrishnan Venkitasubramaniam	On Constant-Round Concurrent Zero-Knowledge.	TCC	2008	DBLP DOI BibTeX RDF
27	Ratna Dutta, Rana Barua	Constant Round Dynamic Group Key Agreement.	ISC	2005	DBLP DOI BibTeX RDF	DDH problem, provable security, group key agreement
27	Alon Rosen	A Note on Constant-Round Zero-Knowledge Proofs for NP.	TCC	2004	DBLP DOI BibTeX RDF
27	Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel	Constant-Round Oblivious Transfer in the Bounded Storage Model.	TCC	2004	DBLP DOI BibTeX RDF
27	Hyun-Jeong Kim, Su-Mi Lee, Dong Hoon Lee 0001	Constant-Round Authenticated Group Key Exchange for Dynamic Groups.	ASIACRYPT	2004	DBLP DOI BibTeX RDF	dynamic authenticated group key exchange, ad hoc networks
27	Emmanuel Bresson, Dario Catalano	Constant Round Authenticated Group Key Agreement via Distributed Computation.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
27	John Watrous	PSPACE Has Constant-Round Quantum Interactive Proof Systems.	FOCS	1999	DBLP DOI BibTeX RDF	quantum computation, interactive proof systems
25	Vipul Goyal, Abhishek Jain 0002	On the round complexity of covert computation.	STOC	2010	DBLP DOI BibTeX RDF	covert computation, cryptography, round complexity
25	Rafael Pass, Muthuramakrishnan Venkitasubramaniam	An efficient parallel repetition theorem for Arthur-Merlin games.	STOC	2007	DBLP DOI BibTeX RDF	computationally-sound arguments, public-coin protocols, proofs of knowledge, Arthur-Merlin games, parallel repetition
24	Yi Deng 0002, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng	Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.	CSR	2009	DBLP DOI BibTeX RDF
22	Huijia Lin, Rafael Pass	Non-malleability amplification.	STOC	2009	DBLP DOI BibTeX RDF	cryptography, commitment, non-malleability, round complexity
22	Peng Zhang, Chengqing Ye, Xin Li, Xuying Ma	An Efficient Keys Agreement for Multi-party's Communication.	PDCAT	2005	DBLP DOI BibTeX RDF
22	Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz	Efficient Multi-party Computation over Rings.	EUROCRYPT	2003	DBLP DOI BibTeX RDF
22	Rosario Gennaro	A Protocol to Achieve Independence in Constant Rounds.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	simultaneous broadcast and Verifiable Secret Sharing (VSS) protocols, computation model, communication networks, Independence
22	Tatsuaki Okamoto, David Chaum, Kazuo Ohta	Direct Zero Knowledge Proofs of Computational Power in Five Rounds.	EUROCRYPT	1991	DBLP DOI BibTeX RDF
19	Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan	Approximation Algorithms for Domatic Partitions of Unit Disk Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
19	Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky	Searchable symmetric encryption: improved definitions and efficient constructions.	CCS	2006	DBLP DOI BibTeX RDF	searchable symmetric encryption, security definitions, multi-user, searchable encryption
19	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
19	Shai Halevi, Silvio Micali	Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing.	CRYPTO	1996	DBLP DOI BibTeX RDF
19	Jonathan Katz	On achieving the "best of both worlds" in secure multiparty computation.	STOC	2007	DBLP DOI BibTeX RDF	secure computation
19	Alan L. Selman, Samik Sengupta	Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy.	CCC	2004	DBLP DOI BibTeX RDF
18	Nan Cheng, Naman Gupta, Aikaterini Mitrokotsa, Hiraku Morita, Kazunari Tozawa	Constant-Round Private Decision Tree Evaluation for Secret Shared Data.	Proc. Priv. Enhancing Technol.	2024	DBLP DOI BibTeX RDF
18	Ching-Fang Hsu 0001, Zhe Xia, Tianshu Cheng, Lein Harn	Extremely Lightweight Constant-Round Membership-Authenticated Group Key Establishment for Resource-Constrained Smart Environments toward 5G.	Comput. J.	2024	DBLP DOI BibTeX RDF
18	Damiano Abram, Jack Doerner, Yuval Ishai, Varun Narayanan	Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output.	EUROCRYPT (5)	2024	DBLP DOI BibTeX RDF
18	Yongjun Wang, Kun Xiong, Yongli Tang, Li Yang, Jing Zhang, Xixi Yan	More efficient constant-round secure multi-party computation based on optimized Tiny-OT and half-gate.	J. Inf. Secur. Appl.	2023	DBLP DOI BibTeX RDF
18	Tapaswini Mohanty, Vikas Srivastava, Sihem Mesnager, Sumit Kumar Debnath	A constant round quantum secure protocol for oblivious polynomial evaluation.	J. Inf. Secur. Appl.	2023	DBLP DOI BibTeX RDF
18	Takeshi Nakai, Kazumasa Shinagawa	Constant-round linear-broadcast secure computation with penalties.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
18	Noga Amit, Guy N. Rothblum	Constant-Round Arguments from One-Way Functions.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
18	Luke Harmon, Gaetan Delavignette	Mercury: Constant-Round Protocols for Multi-Party Computation with Rationals.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
18	Nan Cheng, Naman Gupta, Aikaterini Mitrokotsa, Hiraku Morita, Kazunari Tozawa	Constant-Round Private Decision Tree Evaluation for Secret Shared Data.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
18	Noga Amit, Guy N. Rothblum	Constant-Round Arguments from One-Way Functions.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
18	Matthieu Rambaud	Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
18	Yongfeng Xu, Hanyu Jia, Xiangxue Li, Qiang Li, Yue Bao, Xintian Hou	Constant-Round Multiparty Private Function Evaluation with (Quasi-)Linear Complexities.	ACNS	2023	DBLP DOI BibTeX RDF
18	Luke Harmon, Gaetan Delavignette	Mercury: Constant-Round Protocols for Multi-Party Computation with Rationals.	ISC	2023	DBLP DOI BibTeX RDF
18	Noga Amit, Guy N. Rothblum	Constant-Round Arguments from One-Way Functions.	STOC	2023	DBLP DOI BibTeX RDF
18	Susumu Kiyoshima	Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance.	J. Cryptol.	2022	DBLP DOI BibTeX RDF
18	Hikaru Tsuchida, Takashi Nishide	Constant-Round Fair SS-4PC for Private Decision Tree Evaluation.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2022	DBLP DOI BibTeX RDF
18	Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida	An Efficient Secure Division Protocol Using Approximate Multi-Bit Product and New Constant-Round Building Blocks.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2022	DBLP DOI BibTeX RDF
18	Jie Ma, Bin Qi, Kewei Lv	Constant-round auction with insulated bidders.	Sci. China Inf. Sci.	2022	DBLP DOI BibTeX RDF
18	Takeshi Nakai, Kazumasa Shinagawa	Constant-Round Linear-Broadcast Secure Computation with Penalties.	CoRR	2022	DBLP DOI BibTeX RDF
18	Myungsun Kim	A New Approach to the Constant-Round Re-encryption Mix-Net.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
18	Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam	Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.	SIAM J. Comput.	2022	DBLP DOI BibTeX RDF
18	MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su	Adaptive Massively Parallel Constant-Round Tree Contraction.	ITCS	2022	DBLP DOI BibTeX RDF
18	Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu 0001	Constant-Round Blind Classical Verification of Quantum Sampling.	EUROCRYPT (3)	2022	DBLP DOI BibTeX RDF
18	Shiri Chechik, Tianyi Zhang 0008	Constant-Round Near-Optimal Spanners in Congested Clique.	PODC	2022	DBLP DOI BibTeX RDF
18	Nai-Hui Chia, Kai-Min Chung, Xiao Liang 0014, Takashi Yamakawa	Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.	CRYPTO (3)	2022	DBLP DOI BibTeX RDF
18	Shuichi Hirahara, Rahul Ilango, Bruno Loff	Hardness of Constant-round Communication Complexity.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
18	Nai-Hui Chia, Kai-Min Chung, Xiao Liang 0014, Takashi Yamakawa	Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.	CoRR	2021	DBLP BibTeX RDF
18	MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, Hsin-Hao Su	Adaptive Massively Parallel Constant-round Tree Contraction.	CoRR	2021	DBLP BibTeX RDF
18	Nai-Hui Chia, Kai-Min Chung, Xiao Liang 0014, Takashi Yamakawa	Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
18	Artur Czumaj, Peter Davies, Merav Parter	Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.	SIAM J. Comput.	2021	DBLP DOI BibTeX RDF
18	Omer Reingold, Guy N. Rothblum, Ron D. Rothblum	Constant-Round Interactive Proofs for Delegating Computation.	SIAM J. Comput.	2021	DBLP DOI BibTeX RDF
18	Nai-Hui Chia, Kai-Min Chung, Qipeng Liu 0001, Takashi Yamakawa	On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.	FOCS	2021	DBLP DOI BibTeX RDF
18	Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf	Constant-Round Spanners and Shortest Paths in Congested Clique and MPC.	PODC	2021	DBLP DOI BibTeX RDF
18	Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny	Constant Round Distributed Domination on Graph Classes with Bounded Expansion.	SIROCCO	2021	DBLP DOI BibTeX RDF
18	Shuichi Hirahara, Rahul Ilango, Bruno Loff	Hardness of Constant-Round Communication Complexity.	CCC	2021	DBLP DOI BibTeX RDF
18	Rakyong Choi, Dongyeon Hong, Seongho Han, Seunggeun Baek, Wooseok Kang, Kwangjo Kim	Design and Implementation of Constant-Round Dynamic Group Key Exchange from RLWE.	IEEE Access	2020	DBLP DOI BibTeX RDF
18	Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez	Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.	J. Cryptol.	2020	DBLP DOI BibTeX RDF
18	Hiraku Morita, Nuttapong Attrapadung, Tadanori Teruya, Satsuya Ohata, Koji Nuida, Goichiro Hanaoka	Constant-Round Client-Aided Two-Server Secure Comparison Protocol and Its Applications.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2020	DBLP BibTeX RDF
18	Artur Czumaj, Peter Davies, Merav Parter	Simple, Deterministic, Constant-Round Coloring in the Congested Clique.	CoRR	2020	DBLP BibTeX RDF
18	Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa	A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round.	CoRR	2020	DBLP BibTeX RDF
18	Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu 0001	Constant-round Blind Classical Verification of Quantum Sampling.	CoRR	2020	DBLP BibTeX RDF
18	Vijay K. Garg, Saptaparni Kumar, Lewis Tseng, Xiong Zheng	Amortized Constant Round Atomic Snapshot in Message-Passing Systems.	CoRR	2020	DBLP BibTeX RDF
18	Jun Wan 0008, Hanshen Xiao, Elaine Shi, Srinivas Devadas	Expected Constant Round Byzantine Broadcast under Dishonest Majority.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
18	Rakyong Choi, Dongyeon Hong, Kwangjo Kim	Constant-round Dynamic Group Key Exchange from RLWE Assumption.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
18	Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez	Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
18	Oded Goldreich 0001, Guy N. Rothblum	Constant-Round Interactive Proof Systems for AC0[2] and NC1.	Computational Complexity and Property Testing	2020	DBLP DOI BibTeX RDF
18	Klim Efremenko, Elad Haramaty, Yael Tauman Kalai	Interactive Coding with Constant Round and Communication Blowup.	ITCS	2020	DBLP DOI BibTeX RDF
18	Jun Wan 0008, Hanshen Xiao, Elaine Shi, Srinivas Devadas	Expected Constant Round Byzantine Broadcast Under Dishonest Majority.	TCC (1)	2020	DBLP DOI BibTeX RDF