Abstract is missing.
- A Simpler Variant of Universally Composable Security for Standard Multiparty ComputationRan Canetti, Asaf Cohen, Yehuda Lindell. 3-22 [doi]
- Concurrent Secure Computation via Non-Black Box SimulationVipul Goyal, Divya Gupta 0001, Amit Sahai. 23-42 [doi]
- Concurrent Secure Computation with Optimal Query ComplexityRan Canetti, Vipul Goyal, Abhishek Jain 0002. 43-62 [doi]
- Constant-Round MPC with Fairness and Guarantee of Output DeliveryS. Dov Gordon, Feng-Hao Liu, Elaine Shi. 63-82 [doi]
- Statistical Concurrent Non-malleable Zero-Knowledge from One-Way FunctionsSusumu Kiyoshima. 85-106 [doi]
- Implicit Zero-Knowledge Arguments and Applications to the Malicious SettingFabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee. 107-129 [doi]
- Impossibility of Black-Box Simulation Against Leakage AttacksRafail Ostrovsky, Giuseppe Persiano, Ivan Visconti. 130-149 [doi]
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized CostZhangxiang Hu, Payman Mohassel, Mike Rosulek. 150-169 [doi]
- Parallel Hashing via List RecoverabilityIftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel. 173-190 [doi]
- Cryptography with One-Way CommunicationSanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai. 191-208 [doi]
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and BeyondYu Yu, Dawu Gu, Xiangxue Li, Jian Weng. 209-229 [doi]
- Practical Round-Optimal Blind Signatures in the Standard ModelGeorg Fuchsbauer, Christian Hanser, Daniel Slamanig. 233-253 [doi]
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public KeysDario Catalano, Dario Fiore, Luca Nizzardo. 254-274 [doi]
- Structure-Preserving Signatures from Standard Assumptions, RevisitedEike Kiltz, Jiaxin Pan, Hoeteck Wee. 275-295 [doi]
- Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple AssumptionsBenoît Libert, Thomas Peters, Moti Yung. 296-316 [doi]
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZYehuda Lindell, Benny Pinkas, Nigel P. Smart, Avishay Yanai. 319-338 [doi]
- Round-Optimal Black-Box Two-Party ComputationRafail Ostrovsky, Silas Richelson, Alessandra Scafuro. 339-358 [doi]
- Secure Computation with Minimal Interaction, RevisitedYuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky. 359-378 [doi]
- PoW-Based Distributed Cryptography with No Trusted SetupMarcin Andrychowicz, Stefan Dziembowski. 379-399 [doi]
- Multi-prover Commitments Against Non-signaling AttacksSerge Fehr, Max Fillinger. 403-421 [doi]
- Arguments of Proximity - [Extended Abstract]Yael Tauman Kalai, Ron D. Rothblum. 422-442 [doi]
- Distributions Attaining Secret Key at a Rate of the Conditional Mutual InformationEric Chitambar, Benjamin Fortescue, Min-Hsiu Hsieh. 443-462 [doi]
- Privacy with Imperfect RandomnessYevgeniy Dodis, Yanqing Yao. 463-482 [doi]
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based EncryptionRomain Gay, Iordanis Kerenidis, Hoeteck Wee. 485-502 [doi]
- Predicate Encryption for Circuits from LWESergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee. 503-523 [doi]
- Bilinear Entropy Expansion from the Decisional Linear AssumptionLucas Kowalczyk, Allison Bishop Lewko. 524-541 [doi]
- Data Is a Stream: Security of Stream-Based ChannelsMarc Fischlin, Felix Günther, Giorgia Azzurra Marson, Kenneth G. Paterson. 545-564 [doi]
- Bloom Filters in Adversarial EnvironmentsMoni Naor, Eylon Yogev. 565-584 [doi]
- Proofs of SpaceStefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak. 585-605 [doi]
- Quantum Homomorphic Encryption for Circuits of Low T-gate ComplexityAnne Broadbent, Stacey Jeffery. 609-629 [doi]
- Multi-identity and Multi-key Leveled FHE from Learning with ErrorsMichael Clear, Ciaran McGoldrick. 630-656 [doi]
- From Selective to Adaptive Security in Functional EncryptionPrabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan. 657-677 [doi]
- A Punctured Programming Approach to Adaptively Secure Functional EncryptionBrent Waters. 678-697 [doi]
- Secure Computation from Leaky Correlated RandomnessDivya Gupta 0001, Yuval Ishai, Hemanta K. Maji, Amit Sahai. 701-720 [doi]
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD CircuitsDaniel Genkin, Yuval Ishai, Antigoni Polychroniadou. 721-741 [doi]
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM ProgramsElette Boyle, Kai-Min Chung, Rafael Pass. 742-762 [doi]
- Incoercible Multi-party Computation and Universally Composable Receipt-Free VotingJoël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas. 763-780 [doi]