BLUE
EUeprint.bsky.social

More Efficient Lattice-based OLE from Circuit-private Linear HE with Polynomial Overhead (Leo de Castro, Duhyeong Kim, Miran Kim, Keewoo Lee, Seonhong Min, Yongsoo Song) ia.cr/2024/1534

Abstract. We present a new and efficient method to obtain circuit privacy for lattice-based linearly homomorphic encryptions (LHE). In particular, our method does not involve noise-flooding with exponetially large errors or iterative bootstrapping. As a direct result, we obtain a semi-honest oblivious linear evaluation (OLE) protocol with the same efficiency, reducing the communication cost of the prior state of the art by 50%. Consequently, the amortized time of our protocol improves the prior work by 33% under 100Mbps network setting. Our semi-honest OLE is the first to achieve both concrete efficiency and asymptotic quasi-optimality. Together with an extension of the recent zero-knowledge proof of plaintext knowledge, our LHE yields actively-secure OLE with 2.7x reduced communication from the prior work. When applied to Overdrive (Eurocrypt โ€™18), an MPC preprocessing protocol, our method provides 1.4x improvement in communication over the state of the art.
0
EUeprint.bsky.social

Bitwise Garbling Schemes โ€” A Model with $\frac{3}{2}\kappa$-bit Lower Bound of Ciphertexts (Fei Xu, Honggang Hu, Changhong Xu) ia.cr/2024/1532

Abstract. At Eurocrypt 2015, Zahur, Rosulek, and Evans proposed the model of Linear Garbling Schemes. This model proved a 2ฮบ-bit lower bound of ciphertexts for a broad class of garbling schemes. Since then, several methods have been developed that bypass this lower bound, albeit with a notable limitation: Their reliance on specifically correlated input wire labels restricts their applicability across most gates. At Crypto 2021, Rosulek and Roy presented the innovative โ€œthree-halvesโ€ garbling scheme in which AND gates cost 1.5ฮบโ€…+โ€…5 bits and XOR gates are free. A noteworthy aspect of their scheme is the slicing-and-dicing technique, which is applicable universally to all AND gates when garbling a boolean circuit. Following this revelation, Rosulek and Roy presented several open problems. Our research primarily addresses one of them: โ€œIs 1.5ฮบ bits optimal for garbled AND gates in a more inclusive model than Linear Garbling Schemes?โ€™โ€™

In this paper, we propose the Bitwise Garbling Schemes, a model that seamlessly incorporates the slicing-and-dicing technique. Our key revelation is that 1.5ฮบ bits is indeed optimal for arbitrary garbled AND gates in our model. Since Rosulek and Roy also suggested another problem which questions the necessity of free-XOR, we explore constructions without free-XOR and prove a 2ฮบ-bit lower bound. Therefore, sacrificing compatibility with free-XOR does not lead to a more efficient scheme.
Image showing part 2 of abstract.
0
COcianodonnell.bsky.social

"Excitation/Inhibition imbalance" is a popular theory for brain disorders eg ASD & schizophrenia. Even a clinical trial for a GABA-B agonist in ASD (clinicaltrials.gov/study/NCT03...).โ€ฉ But I just don't get it.โ€ฉ In this diagram of an E-I circuit, which synapses count as excitatory vs inhibitory?

Simple circuit diagram of excitatory-inhibitory recurrent neural network, with all possible synapse types indicated.
0
TMtommyreckless.bsky.social

When did you do your stand up Graeme? Was it on the Scottish comedy circuit?

1
THthehalt.bsky.social

A metal shutter, buckling on Wesleyan brick, no light, no power. To whom is left this relic of the Methodist Circuit? (41/68, 'White Thorns', 2017)

0
Ppytorch.kr

AlphaChip: ๊ฐ•ํ™”ํ•™์Šต(RL) ๊ธฐ๋ฐ˜์˜ ์นฉ ๋ฐฐ์น˜ ์ƒ์„ฑ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์—ฐ๊ตฌ (feat. Google) (by 9bow๋‹˜) https://d.ptln.kr/5291 #google #ai-chip #reinforcement-learning #tpu #circuit-design #trilium #replace #edge-gnn #markov-decision-process #floorplan #alphachip

AlphaChip: ๊ฐ•ํ™”ํ•™์Šต(RL) ๊ธฐ๋ฐ˜์˜ ์นฉ ๋ฐฐ์น˜ ์ƒ์„ฑ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์—ฐ๊ตฌ (feat. Google)
AlphaChip: ๊ฐ•ํ™”ํ•™์Šต(RL) ๊ธฐ๋ฐ˜์˜ ์นฉ ๋ฐฐ์น˜ ์ƒ์„ฑ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์—ฐ๊ตฌ (feat. Google)

๋“ค์–ด๊ฐ€๋ฉฐ :pytorch:๐Ÿ‡ฐ๐Ÿ‡ท ์ง€๋‚œ 9์›” ๋ง AlphaChip์ด๋ผ๊ณ  ์ด๋ฆ„ ๋ถ™์ธ, ๊ฐ•ํ™”ํ•™์Šต ๊ธฐ๋ฐ˜์˜ ์นฉ ๋ฐฐ์น˜ ์ƒ์„ฑ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์งง์€ ์ถ”๊ฐ€ ๋…ผ๋ฌธ(Addendum)์ด nature์— ๊ณต๊ฐœ๋˜์—ˆ์Šต๋‹ˆ๋‹ค. AlphaChip์€ ์ง€๋‚œ 2020๋…„ ๊ณต๊ฐœ๋œ ๊ฐ•ํ™”ํ•™์Šต(RL) ๊ธฐ๋ฐ˜์˜ ์นฉ ์„ค๊ณ„ ๋ฐ ๋ฐฐ์น˜(Chip Design & Placement) ์ƒ์„ฑ ๋ฐฉ๋ฒ•์— ๋Œ€ํ•œ ์—ฐ๊ตฌ(A graph placement methodology for fast chip design)๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœ ํ•˜๊ณ  ์žˆ์œผ๋ฉฐ, Google์˜ TPU ์„ค๊ณ„์— ์‹ค์ œ๋กœ ์ ์šฉ๋œ ๊ฒƒ์œผ๋กœ ์œ ๋ช…ํ•ฉ๋‹ˆ๋‹ค. ์ด๋ฒˆ์— ์ถ”๊ฐ€๋œ ๋…ผ๋ฌธ(Addendum)์—์„œ๋Š” ์‚ฌ์ „ํ•™์Šต์„ ํ™œ์šฉํ•œ ํšจ์œจ์„ฑ ์ฆ๋Œ€๋ฅผ ๋น„๋กฏํ•˜์—ฌ ์ดˆ๊ธฐ ๋ฐฐ์น˜์™€ ๋ฒค์น˜๋งˆํฌ ๋“ฑ์— ๋Œ€ํ•œ ๋‚ด์šฉ์„ ๋‹ค๋ฃจ๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค. ์ด๋Ÿฌํ•œ ์ถ”๊ฐ€ ๋…ผ๋ฌธ ์ดํ•ด๋ฅผ ์œ„ํ•ด ๋จผ์ € ์ง€๋‚œ 2020๋…„ ๊ณต๊ฐœ๋œ ๋…ผ๋ฌธ ๋‚ด์šฉ์„ ๊ฐ„๋žตํžˆ ๋‹ค๋ฃจ๊ณ , ์ถ”๊ฐ€๋œ ๋‚ด์šฉ์„ ์‚ดํŽด๋ณด๋„๋ก ํ•˜๊ฒ ์Šต๋‹ˆ๋‹ค. AlphaChip์˜ ๊ธฐ๋ฐ˜ ์—ฐ๊ตฌ: A graph placement methodology for fast...

0
JWarghzombies.bsky.social

Yeah, it's doing the festival circuit trying to drum up interest to get distribution. I hope it does, it's a fun sequel. Utter trash, sure, but a cool idea. And a lot better than the original.

0