BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//TYPO3/NONSGML News system (news)//EN
BEGIN:VEVENT
UID:news-22945@cs.au.dk
DTSTAMP:20210817T075613Z
DTSTART:20180620T110000Z
DTEND:20180620T120000Z
END:VEVENT
END:VCALENDAR




<div class="news news-single">
	<div class="article" itemscope="itemscope" itemtype="http://schema.org/Article">
		
	
			<script type="text/javascript">
				const showAllContentLangToken = "Vis alt indhold ";
			</script>

			
			

			<article class="typo3-delphinus delphinus-gutters">

				<!-- News PID: 4980 - used for finding folder/page which contains the news / event -->
				<!-- News UID: 22945 - the ID of the current news / event-->

				<div class="news-event">
					<div class="news-event__header">
						<!-- Categories -->
						
							<span class="text--stamp">
<!-- categories -->
<span class="news-list-category">
	
		
	
		
	
		
	
</span>

</span>
						

						<!-- Title -->
						<h1 itemprop="headline">Talk by Aner Moshe Ben Efraim </h1>
						
					</div>

					

					<div class="news-event__content">

						<!-- Events info box -->
						
								

								<div class="news-event__info theme--dark" id="event-info">
									<h2 class="screenreader-only">Oplysninger om arrangementet</h2>

									
											<!--- Same date -->
											<div class="news-event__info__item news-event__info__item--time">
												<h3 class="news-event__info__item__header text--label-header">Tidspunkt</h3>
												<div class="news-event__info__item__content">
													<span class="u-avoid-wrap">
														Onsdag 20. juni 2018,
													</span>
													<span class="u-avoid-wrap">
														&nbsp;kl. 13:00 -  14:00
													</span>
													<p class="news-event__info__item__ical-link"><a href="/da/news-events/arrangementer/vis-event/artikel/talk-by-aner-moshe-ben-efraim?tx_news_pi1%5Bformat%5D=ical&amp;type=9819&amp;cHash=9df8364f442beb513bc741038a1bfb98">Tilføj til kalender</a></p>
												</div>
											</div>
										

									<!-- Location detailed -->
									
											<!-- Location Simple -->
											
												<div class="news-event__info__item">
													<h3 class="news-event__info__item__header text--label-header">Sted</h3>
													<div class="news-event__info__item__content">
														<p>Nygaard 295</p>
													</div>
												</div>
											
										

									<!-- Organizer detailed -->
									
											<!-- Organizer Simple -->
											
										

									<!-- Price -->
									

									<!-- Event link -->
									

									<!-- Registration -->
									
								</div>
							

						
							<!-- Media -->
							
								



							
						

						
							<div class="news-event__content__text">
								<span class="text--byline" id="byline">
									

									<!-- Author -->
									
										<span itemprop="author" itemscope="itemscope" itemtype="http://schema.org/Person">
											
													Af
												

											
													<a href="mailto:malene.andersen@cs.au.dk">
														<span itemprop="name">Malene Bisgaard Blaabjerg Andersen</span>
													</a>
												
										</span>
									
								</span>

								

									<!-- Body text -->
									<p><strong>Title:</strong>&nbsp;On Multiparty Garbling of Arithmetic Circuits</p>
<p><strong>Abstract:</strong>&nbsp;</p>
<p>Secure multiparty computation enable a set of (mutually distrusting) parties to carry out a joint computation on private inputs correctly and without revealing anything but the output. In recent years, there has been a huge amount of work dedicated to providing secure multiparty computation protocols that can be efficiently run in practice. In particular, there has also been a growing interest in multiparty protocols following the&nbsp;multiparty garbling paradigm, introduced by Beaver et al.&nbsp;(STOC ’90), due to their performance in high latency networks, such as the internet.</p>
<p>Prior to this work, these multiparty garbling protocols&nbsp;were solely for Boolean circuits, and arithmetic garbled circuits were discussed only in the 2-party setting. In this work, we initiate a study of garbled circuits that contain both Boolean and arithmetic gates in secure<em>multiparty</em>&nbsp;computation. In particular, we incorporate the 2-party garbling gadgets for arithmetic circuits recently presented by Ball et al. (ACM CCS 2016) into the multiparty garbling paradigm, and also present new garbling gadgets. Using mixed Boolean-arithmetic circuits allows more efficient secure computation of functions that naturally combine Boolean and arithmetic computations.</p>
								
							</div>
						
					</div>

					
						<!-- Content elements -->
						
					
				</div>
			</article>

			
				
				
			

			<!-- related things -->
			
		

	</div>
</div>