نتایج جستجو برای: universal message

تعداد نتایج: 172516  

Journal: :IACR Cryptology ePrint Archive 2007
Siamak Fayyaz Shahandashti Reihaneh Safavi-Naini

We give a generic construction for universal designated-verifier signature schemes from a large class, C, of signature schemes. The resulting schemes are efficient and have two important properties. Firstly, they are provably DV-unforgeable, non-transferable and also non-delegatable. Secondly, the signer and the designated verifier can independently choose their cryptographic settings. We also ...

2000
Scott R. Nollet

In this thesis, we explore a topic within cryptography called Message Authentication Codes (MACs). A MAC is a collection of algorithms which allows A to send a message to B in such a way that B can be certain (with very high probability) that A did in fact originate the message. Let’s say A wants to send a message (string) M to B using a MAC. First A will run the “tag generation” algorithm on M...

Journal: :IEEE Trans. Information Theory 1973
Lee D. Davisson

A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...

Journal: :International Journal of Approximate Reasoning 2022

Stochastic approximation methods for variational inference have recently gained popularity in the probabilistic programming community since these are amenable to automation and allow online, scalable, universal approximate Bayesian inference. Unfortunately, common Probabilistic Programming Languages (PPLs) with stochastic engines lack efficiency of message passing-based algorithms deterministic...

Journal: :The Journal of the Acoustical Society of America 1963

Journal: :IACR Cryptology ePrint Archive 2017
Fanbao Liu Fengmei Liu

An universal forgery attack means that for any given message M , an adversary without the key can forge the corresponding Message Authentication Code (MAC) tag τ , and the pair (M, τ) can be verified with probability 1. For a idea MAC, the universal forgery attack should be infeasible to be implemented, whose complexity is believed to be min(2, 2) queries in the classic setting, where n is the ...

Journal: :international journal of pediatrics 0
ali ramezankhani professor, department of public health, school of public health, shahid beheshti university of medical sciences, tehran, iran. mohtasham ghaffari associate professor, department of public health, school of public health, shahid beheshti university of medical sciences, tehran, iran. yadollah mehrabi professor, department of epidemiology, school of public health, shahid beheshti university of medical sciences, tehran, iran. seyyed hannan kashfi larestan school of nursing, shiraz university of medical sciences, shiraz, iran. akbar babaei heydarabadi assistant professor, department of health education and health promotion, school of public health, ahvaz jundishapur university of medical sciences, ahvaz, iran.

background: mobile phone is one of the most important necessary tools in today’s life which can threaten people’s health in some conditions. the present study was carried out to compare the effect of educational intervention by short message and pamphlet on the behavior of steel factory staff in ardakan, yazd province, iran.materials and methods: the present study was experimentally carried out...

Journal: :Journal of the Canadian Health Libraries Association / Journal de l'Association des bibliothèques de la santé du Canada 2014

Journal: :CoRR 2008
Shigeaki Kuzuoka Akisato Kimura Tomohiko Uyematsu

This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیخ بهایی - دانشکده زبانهای خارجی 1391

simplification universal as a universal feature of translation means translated texts tend to use simpler language than original texts in the same language and it can be critically investigated through common concepts: type/token ratio, lexical density, and mean sentence length. although steps have been taken to test this hypothesis in various text types in different linguistic communities, in ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید