Filters








116 Hits in 6.0 sec

Algebraic pseudorandom functions with improved efficiency from the augmented cascade

Dan Boneh, Hart William Montgomery, Ananth Raghunathan
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic Naor-Reingold algebraic PRF.  ...  To do so we define an augmented cascade and prove it secure when the underlying PRF satisfies a property called parallel security. We then use the augmented cascade to build new algebraic PRFs.  ...  The proof should not interfere with the pseudorandom properties of the PRF. We give two VRF constructions from the augmented cascade.  ... 
doi:10.1145/1866307.1866323 dblp:conf/ccs/BonehMR10 fatcat:qbsoei4kx5f53dwdkevxcas4yi

Modelling of semiconductor optical amplifier chirp compensation using optical delay interferometer

Z. V. Rizou, K. E. Zoiros, M. J. Connelly
2011 2011 Numerical Simulation of Optoelectronic Devices  
The simulation conducted for this purpose allows to specify the optimum temporal offset inserted by the cascaded ODI that effectively reduces the magnitude of the chirp and the variations of its peaks  ...  The feasibility of employing an optical delay interferometer (ODI) to compensate for the chirp imposed by a semiconductor optical amplifier (SOA) on its driving data pulses is demonstrated through the  ...  Nevertheless, owing to the ODI the situation is gradually improved as ∆τ is increased in steps of 3 ps and up to 9 ps.  ... 
doi:10.1109/nusod.2011.6041153 fatcat:6p55umzinne27ccloop423mjkq

An Algebraic Framework for Diffie–Hellman Assumptions

Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge Villar
2015 Journal of Cryptology  
The results imply very significant efficiency improvements for a large number of schemes, most notably Naor-Yung type of constructions.  ...  It has found applications to encryption [28, 7, 5, 35], signatures [3], zeroknowledge proofs [22], pseudorandom functions [6] and many more.  ...  Under the D ,k -MDDH Assumption PRF Gen,D ,k is a secure pseudo-random function. Proof. For our proof we require the reader to be familiar with the augmented cascade construction of Boneh et al.  ... 
doi:10.1007/s00145-015-9220-6 fatcat:r6ufzdfdonc4lomln4viirsvzq

Improved Efficient Arguments [chapter]

Joe Kilian
1995 Lecture Notes in Computer Science  
Aside from the quantitative improvements, our results become qualitatively different when considering arguers that can run for some superpolynomial but bounded amount of time.  ...  The best previous known bound was This can be based on fairly general algebraic aesumptions, such as the hardness of diacrete logarithms.  ...  Dan Spielman provided early and invaluable information on his work with Polishchuk, which greatly improved the results of an earlier version of this manuscript.  ... 
doi:10.1007/3-540-44750-4_25 fatcat:v45yljjhjbf2lcl2fhxdmnjyjq

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
This report continues this work, but shifts the emphasis from the use of algebra automata as acceptors to the dynamics of algebras with outputs.  ...  New results are obtained on the proper selection of a tail machine. Efficient techniques for the cascade decomposition of some classes of semi-automata are discussed.  ... 
doi:10.1109/tc.1968.226455 fatcat:syhwt24pazahde6pjqsan47epq

On Maximizing Weighted Algebraic Connectivity for Synthesizing Robust Networks [article]

Harsha Nagarajan
2018 arXiv   pre-print
the feasible set of MISDPs using Fiedler vectors or Laplacian with equivalency guarantees, and efficient neighborhood-search-based heuristic algorithms.  ...  springs with a specified cost and stiffness, a resource constraint in terms of a budget on the total cost, the problem is to determine an optimal connection of masses and springs so that the resulting  ...  from the improved 3-opt heuristic and λ 2opt imp 2 is the algebraic connectivity of a solution obtained from the improved 2-opt heuristic.  ... 
arXiv:1805.07825v1 fatcat:vxw45yi65vg2xpw6yoezzvlkmq

Abstracts of Current Computer Literature

1970 IEEE transactions on computers  
A procedure is given which allows one to generate rather efficiently all prime cascade realizable functions which imply a given switching function.  ...  Extensions are made to the simultaneous realization of several switching functions, each the output of a separate collector cascade fed from the same array.  ... 
doi:10.1109/t-c.1970.222960 fatcat:ire5kgre7fch5ppqcmq2bjesvi

Abstracts of Current Computer Literature

1971 IEEE transactions on computers  
The essential properties required of pseudorandom sequences are considered in detail. Particular attention is devoted to efficient statistical tests of these properties.  ...  The computational errors were compared with corresponding results obtained from the base-2 algorithm.  ... 
doi:10.1109/t-c.1971.223093 fatcat:xxhdbzhhdzdp5e5wznkfj3yoai

Multistage Iterative Decoding With Complexity Reduction for Concatenated Space–Time Codes

A. Reial, S.G. Wilson
2005 IEEE Transactions on Communications  
The performance curves for these methods follow the shape of the Fano bound, with only a modest power penalty.  ...  Space-time encoders exploiting concatenated coding structures are efficient in attaining the high rates available to largedimensional multiple-transmitter, multiple-receiver wireless systems under fading  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their useful comments and suggestions.  ... 
doi:10.1109/tcomm.2005.852848 fatcat:7goy4hqhozfghf2vgl76jydaae

PID control system analysis, design, and technology

Kiam Heong Ang, G. Chong, Yun Li
2005 IEEE Transactions on Control Systems Technology  
Corresponding to these developments, this paper presents a modern overview of functionalities and tuning methods in patents, software packages and commercial hardware modules.  ...  This stimulates the development of "intelligent" tools that can assist engineers to achieve the best overall PID control for the entire operating envelope.  ...  The message that increasing the derivative gain, , will lead to improved stability is commonly conveyed from academia to industry.  ... 
doi:10.1109/tcst.2005.847331 fatcat:glgqlv5nqnflti2gq5cdoxewg4

Efficient Set Membership Proofs using MPC-in-the-Head

Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
2022 Proceedings on Privacy Enhancing Technologies  
We also show that our techniques can be used to efficiently construct post-quantum secure RingCT from only symmetric key primitives.  ...  In this work, we develop a new technique for efficiently adding logarithmic-sized set membership proofs to any MPC-in-the-head based zero-knowledge protocol (Ishai et al. [STOC'07]).  ...  Acknowledgments The first and second authors are supported in part by NSF  ... 
doi:10.2478/popets-2022-0047 fatcat:kjnmuvna7nh2jc2pxlgihgvekm

1-Pass Relative-ErrorLp-Sampling with Applications [chapter]

Morteza Monemizadeh, David P. Woodruff
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
Our generic sampling framework improves and unifies algorithms for several communication and streaming problems, including cascaded norms, heavy hitters, and moment estimation.  ...  For any p ∈ [0, 2], we give a 1-pass poly(ε −1 log n)-space algorithm which, given a data stream of length m with insertions and deletions of an n-dimensional vector a, with updates in the range {−M, −  ...  24] , and linear algebra [10, 33] , to name a few.  ... 
doi:10.1137/1.9781611973075.92 dblp:conf/soda/MonemizadehW10 fatcat:zuki7b5rlvfozkwj23exg7bzxm

An Introduction to Logic Circuit Testing

Parag K. Lala
2008 Synthesis Lectures on Digital Circuits and Systems  
In addition to normal, serial scan, and MISR function, the modified BILBO can also function as an LFSR, thus generating pseudorandom patterns (Figure 4.24b).  ...  In addition to normal, serial scan, and MISR function, the modified BILBO can also function as an LFSR, thus generating pseudorandom patterns (Figure 4.24b) .  ...  A widely accepted approach to deal with the testing problem at the chip level is to incorporate built-in self-test (BIST) capability inside a chip.  ... 
doi:10.2200/s00149ed1v01y200808dcs017 fatcat:vm4fduadpfcodcjwr4vtzdac6i

On the Error Probability Evaluation in Lightwave Systems With Optical Amplification

Enrico Forestieri, Marco Secondini
2009 Journal of Lightwave Technology  
We compare their complexity and computational efficiency, and discuss the most relevant implementation issues.  ...  For this method, we also introduce an equivalent form of the moment generating function, that avoids the singularity for eigenvalues equal to zero, and derive an alternative expansion where signal and  ...  THE KLSE METHOD The BER at the output of the decision gate can be evaluated by determining the probability density function (pdf) associated with each detected bit of a pseudorandom bit sequence of length  ... 
doi:10.1109/jlt.2008.927770 fatcat:iz65cz37obaqtg3kdbvvrfeksu

Cryptographic Hash Functions [chapter]

Kenneth A. Ross, Christian S. Jensen, Richard Snodgrass, Curtis E. Dyreson, Christian S. Jensen, Richard Snodgrass, Spiros Skiadopoulos, Cristina Sirangelo, Mary Lynette Larsgaard, Gösta Grahne, Daniel Kifer, Hans-Arno Jacobsen (+106 others)
2009 Encyclopedia of Database Systems  
The latter includes a construction method for hash functions and four designs, of which one was submitted to the SHA-3 hash function competition, initiated by the U.S. standardisation body NIST.  ...  It also includes cryptanalysis of the construction method MDC-2, and of the hash function MD2. iii iv v vi Preface  ...  Larger values of d constitute improvements with respect to attack efficiency.  ... 
doi:10.1007/978-0-387-39940-9_2324 fatcat:hdth6b5byfhtdfk67ds7x3css4
« Previous Showing results 1 — 15 out of 116 results