Filters








24,327 Hits in 5.7 sec

Efficient recovering of operation tables of black box groups and rings [article]

Jens Zumbragel, Gerard Maze, Joachim Rosenthal
2008 arXiv   pre-print
We also investigate black box rings and give lower and upper bounds for the number of queries needed to solve product recovering in this case.  ...  People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation * on S which might come from a group law, and suppose you have access to an oracle that  ...  The basic question we are interested in this paper is, given a black box group or black box ring, how many calls to the oracle are necessary to recover the whole operation tables.  ... 
arXiv:0805.0514v1 fatcat:kh356egys5aujo6dsxhfbmqhwu

Efficient recovering of operation tables of black box groups and rings

Jens Zumbragel, Gerard Maze, Joachim Rosenthal
2008 2008 IEEE International Symposium on Information Theory  
We also investigate black box rings and give lower und upper bounds for the number of queries needed to solve product recovering in this case.  ...  People have been studying the following problem: Given a finite set S with a hidden (black box) binary operation * : S × S → S which might come from a group law, and suppose you have access to an oracle  ...  The basic question we are interested in this paper is, given a black box group or black box ring, how many calls to the oracle are necessary to recover the whole operation tables.  ... 
doi:10.1109/isit.2008.4595064 dblp:conf/isit/ZumbragelMR08 fatcat:2za5qfmdbvgota65rmu4hpxgce

Getting Rid of Linear Algebra in Number Theory Problems [article]

Paul Kirchner, Pierre-Alain Fouque
2020 IACR Cryptology ePrint Archive  
We revisit some well-known cryptographic problems in a black box modular ring model of computation. This model allows us to compute with black box access to the ring Z/mZ.  ...  We develop new generic ring algorithms to recover m even if it is unknown. At the end, Maurer's generic algorithm allows to recover an element from its black box representation.  ...  We introduced a new representation allowing us to perform efficiently all ring operations. We proposed new black-box algorithms to recover the ring order and solve VDF problems.  ... 
dblp:journals/iacr/KirchnerF20 fatcat:ejas5sc4pngxtikrgh5l4kwen4

Obfuscating Conjunctions

Zvika Brakerski, Guy N. Rothblum
2015 Journal of Cryptology  
Our construction is based on multilinear maps, and can be instantiated using the recent candidates proposed by Garg, Gentry and Halevi (EUROCRYPT 2013) and by Coron, Lepoint and Tibouchi (CRYPTO 2013).  ...  Security follows from multilinear entropic variants of the Diffie-Hellman assumption.  ...  We thank Ryo Nishimaki for pointing us to the zeroing attack on [GGH13] , and the authors of [CLT13] for discussing the applicability of such attack on their scheme.  ... 
doi:10.1007/s00145-015-9221-5 fatcat:s2jt4vvpdvb5xix3er7c2dbweq

Obfuscating Conjunctions [chapter]

Zvika Brakerski, Guy N. Rothblum
2013 Lecture Notes in Computer Science  
Our construction is based on multilinear maps, and can be instantiated using the recent candidates proposed by Garg, Gentry and Halevi (EUROCRYPT 2013) and by Coron, Lepoint and Tibouchi (CRYPTO 2013).  ...  Security follows from multilinear entropic variants of the Diffie-Hellman assumption.  ...  We thank Ryo Nishimaki for pointing us to the zeroing attack on [GGH13] , and the authors of [CLT13] for discussing the applicability of such attack on their scheme.  ... 
doi:10.1007/978-3-642-40084-1_24 fatcat:pmltma7cpvb53f6dzrafjnbyi4

Black-box obfuscation for d-CNFs

Zvika Brakerski, Guy N. Rothblum
2014 Proceedings of the 5th conference on Innovations in theoretical computer science - ITCS '14  
We prove that the construction is a secure obfuscation in a generic multilinear group model, under the black-box definition of Barak et al. (CRYPTO 2001).  ...  The family of functions we obfuscate is considerably richer than previous works that consider black-box obfuscation. 1 As one application, we show how to achieve obfuscated functional point testing: namely  ...  We thank Shafi Goldwasser for helpful and insightful comments, and Moni Naor for bring to our attention the connections between the Bounded Speedup Hypothesis and parameterized complexity theory.  ... 
doi:10.1145/2554797.2554820 dblp:conf/innovations/BrakerskiR14 fatcat:2kej2lejavalpdsmjwnafxobku

MEASURING TRANSIT SIGNAL RECOVERY IN THEKEPLERPIPELINE. II. DETECTION EFFICIENCY AS CALCULATED IN ONE YEAR OF DATA

Jessie L. Christiansen, Bruce D. Clarke, Christopher J. Burke, Shawn Seader, Jon M. Jenkins, Joseph D. Twicken, Joseph D. Catanzarite, Jeffrey C. Smith, Natalie M. Batalha, Michael R. Haas, Susan E. Thompson, Jennifer R. Campbell (+2 others)
2015 Astrophysical Journal  
We also find that the pipeline algorithms recover the depths and periods of the injected signals with very high fidelity, especially for periods longer than 10 days.  ...  We compare the set of detections made by the pipeline with the expectation from the set of simulated planets, and construct a sensitivity curve of signal recovery as a function of the signal-to-noise of  ...  We also examined the different electronic artifacts that were sampled (e.g., variable black/bias correction, FGS crosstalk, rolling band artifacts, and start-of-line ringing; see the footnotes of Table  ... 
doi:10.1088/0004-637x/810/2/95 fatcat:a637ywsrlvawhmpw5lbk4u55ke

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding [chapter]

Zvika Brakerski, Guy N. Rothblum
2014 Lecture Notes in Computer Science  
We prove that the obfuscator exposes no more information than the program's black-box functionality, and achieves virtual black-box security, in the generic graded encoded scheme model.  ...  In their work, [BGI + 12] proved the impossibility of generalpurpose black-box obfuscators (i.e. ones that work for any polynomial-time functionality) in the virtual black box model.  ...  Efficient Simulation and Virtual Black-Box Obfuscation. To get efficient black-box simulation (and virtual black-box security), we need to address the above difficulty.  ... 
doi:10.1007/978-3-642-54242-8_1 fatcat:cp3ksb2qvndsvlma4rrayrl7bu

Search for proton decay into three charged leptons in 0.37 megaton-years exposure of the Super-Kamiokande [article]

Super-Kamiokande Collaboration: M. Tanaka, K. Abe, C. Bronner, Y. Hayato, M. Ikeda, S. Imaizumi, H. Ito, J. Kameda, Y. Kataoka, Y. Kato, Y. Kishimoto, Ll. Marti (+159 others)
2020 arXiv   pre-print
All possible combinations of electrons, muons and their anti-particles consistent with charge conservation were considered as decay modes.  ...  No significant excess of events has been found over the background, and lower limits on the proton lifetime divided by the branching ratio have been obtained.  ...  Estimated partial lifetime lower limit for each mode of proton decay into three charged leptons by this analysis (red histogram), IMB-3 (star) [9] and HPW (circle) [10] experiments.  ... 
arXiv:2001.08011v2 fatcat:ggffmrppxjchhkjcgrcind3dae

Cryptanalysis of a Matrix-based MOR System

Chris Monico
2015 Communications in Algebra  
We show that this problem can be reduced to a small number of similar problems in quotients of polynomial rings and solved in subexponential-time.  ...  The security of the system depends on the difficulty of solving the following discrete logarithm problem: given an inner automorphism φ of SL(d, F q ) and φ a (each given in terms of their images on generators  ...  Recovering a scalar multiple of A Suppose φ is an automorphism of SL(d, F q ) of the form φ(X) = U −1 XU for some unknown U ∈ GL(d, F q ) and we have 'black-box access' to φ.  ... 
doi:10.1080/00927872.2014.974254 fatcat:uteikylqr5eebiuwuf2mygbfem

Classification of weighted networks through mesoscale homological features [article]

Ann Sizemore, Chad Giusti, Danielle Bassett
2016 arXiv   pre-print
We present a classification of 14 commonly studied weighted network models into four groups or classes, and discuss the structural themes arising in each class.  ...  As complex networks find applications in a growing range of disciplines, the diversity of naturally occurring and model networks being studied is exploding.  ...  (a) (Top) Clustering coefficient (C) and (bottom) global efficiency (E glob ) shown by group and individually. Individual network boxes shown in black, shaded by group color.  ... 
arXiv:1512.06457v2 fatcat:c2qitgblvbbehiqedoe7irmvvq

Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies [article]

Benjamin Smith
2019 arXiv   pre-print
Diffie-Hellman key exchange is at the foundations of public-key cryptography, but conventional group-based Diffie-Hellman is vulnerable to Shor's quantum algorithm.  ...  A range of "post-quantum Diffie-Hellman" protocols have been proposed to mitigate this threat, including the Couveignes, Rostovtsev-Stolbunov, SIDH, and CSIDH schemes, all based on the combinatorial and  ...  This betrays the fact that Algorithm 9 is just a black-box group algorithm operating on a hidden version of G.  ... 
arXiv:1809.04803v3 fatcat:feyexp5afbdurg5rbtbp75rvgq

Pre- and Post-quantum Diffie–Hellman from Groups, Actions, and Isogenies [chapter]

Benjamin Smith
2018 Lecture Notes in Computer Science  
Diffie-Hellman key exchange is at the foundations of publickey cryptography, but conventional group-based Diffie-Hellman is vulnerable to Shor's quantum algorithm.  ...  A range of "post-quantum Diffie-Hellman" protocols have been proposed to mitigate this threat, including the Couveignes, Rostovtsev-Stolbunov, SIDH, and CSIDH schemes, all based on the combinatorial and  ...  This betrays the fact that Algorithm 9 is just a black-box group algorithm operating on a hidden version of G.  ... 
doi:10.1007/978-3-030-05153-2_1 fatcat:hrtt6eon7fhnlpfkwxmzwtgd4a

Search for proton decay into three charged leptons in 0.37 megaton-years exposure of the Super-Kamiokande

M. Tanaka, K. Abe, C. Bronner, Y. Hayato, M. Ikeda, S. Imaizumi, H. Ito, J. Kameda, Y. Kataoka, Y. Kato, Y. Kishimoto, Ll. Marti (+170 others)
2020 Physical Review D  
All possible combinations of electrons, muons, and their antiparticles consistent with charge conservation were considered as decay modes.  ...  No significant excess of events has been found over the background, and lower limits on the proton lifetime divided by the branching ratio have been obtained.  ...  Signal efficiency and expected background events after all selections are summarized in Table I .  ... 
doi:10.1103/physrevd.101.052011 fatcat:fpuwjikb4rd3fofw56mtzvx37e

Selective hydrogenation of 5-hydroxymethylfurfural and its acetal with 1,3-propanediol to 2,5-bis(hydroxymethyl)furan using supported rhenium-promoted nickel catalysts in water

Jan Wiesfeld, Minjune Kim, Kiyotaka Nakajima, Emiel J.M. Hensen
2020 Green Chemistry  
Building a biobased economy requires restructuring the chemical industry in such a way that it is based on renewable carbon instead of fossil fuels. Atom-efficient and scalable approaches need to...  ...  This work was supported by The Netherlands Center for Multiscale Catalytic Energy Conversion (MCEC), an NWO Gravitation programme funded by the Ministry of Education, Culture and Science of the Government  ...  of The Netherlands.  ... 
doi:10.1039/c9gc03856f fatcat:gudknwxbz5emnehrktwerrmjoa
« Previous Showing results 1 — 15 out of 24,327 results