Filters








3,914 Hits in 5.7 sec

Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme

Kaoru Kurosawa, Kazuhiro Suzuki
2009 IEEE Transactions on Information Theory  
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver.  ...  In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n.  ...  For r = 1, Dolev et al. showed that there exists a 1-round perfectly secure message transmission scheme (PSMT) if and only if n ≥ 3t + 1 [2] . They also showed an efficient 1-round PSMT [2] .  ... 
doi:10.1109/tit.2009.2030434 fatcat:swmnsiamj5f7tebsrznyory35m

Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme [chapter]

Kaoru Kurosawa, Kazuhiro Suzuki
Advances in Cryptology – EUROCRYPT 2008  
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver.  ...  In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n.  ...  For r = 1, Dolev et al. showed that there exists a 1-round perfectly secure message transmission scheme (PSMT) if and only if n ≥ 3t + 1 [2] . They also showed an efficient 1-round PSMT [2] .  ... 
doi:10.1007/978-3-540-78967-3_19 dblp:conf/eurocrypt/KurosawaS08 fatcat:s5ie56ic5rcyrfwj4s2zwv6jpu

Interactive Encryption and Message Authentication [chapter]

Yevgeniy Dodis, Dario Fiore
2014 Lecture Notes in Computer Science  
We observe that our 2-round PKMA scheme is both replay-secure and (passively) deniable, and our 2-round PKE scheme is both replayand forward-secure.  ...  In contrast, we show an efficient 2-round PKMA from most popular assumptions, including factoring, CDH and DDH. Advanced Properties.  ...  schemes: 3 (a) "black-box" 2-round chosen-ciphertext attack (CCA-) secure PKE from any (non-interactive) chosen-plaintext attack (CPA-) secure PKE; (b) efficient 2-round strongly unforgeable PKMA scheme  ... 
doi:10.1007/978-3-319-10879-7_28 fatcat:c77p7phskrht3kiamsbh7h2y54

Non-Cooperative Eavesdropping Resisted Using Ford-Fulkerson And AES By Secure coding

Sreelekshmi Murali
2014 IOSR Journal of Computer Engineering  
Because of the three important properties of this scheme one time pad scheme can accepted as the most prominent security providing mechanism,properties such as: key must be as long as the plain text, key  ...  must be truly random and key must only be used once.  ...  [2] proposed a model, call the wiretap network, that incorporates information security with network coding.  ... 
doi:10.9790/0661-16585055 fatcat:fyfq5s5n5jdu5dsmyardzvdrva

Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring

Chunhui Wu, Qin Li, Dongyang Long
2015 Journal of Communications  
The formal proofs show that our proposed schemes satisfy all the desired security properties.  ...  We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-malleable schemes.  ...  The main idea to achieve nonmalleability is to add a three round efficient zeroknowledge proof after committing to a message using the malleable ID-based trapdoor commitment.  ... 
doi:10.12720/jcm.10.5.330-338 fatcat:gxmfmrarindv7ffxjggj4bn7va

Implementation and analysis of practical algorithm for data security

Willi Ballenthin, Foti Kacani, Julia Albath, Sanjay Madria
2008 2008 Fourth International Conference on Wireless Communication and Sensor Networks  
Simulation and empirical results of the scheme are also provided. The analysis shows that the Practical Algorithm for Data Security is superior to standard security schemes.  ...  In this paper, we present a complete implementation of the Practical Algorithm for Data Security (PADS) proposed by Albath et al., an end-to-end security scheme employing symmetric key encryption.  ...  Figure 5a . 5a CPU Table 1 : 1 Mica Specs Table 2 : 2 Memory utilization of three security protocols on Motes Scheme RAM (Bytes) ROM (bytes) MemTest no security 743 13770 MemTest with TinySec  ... 
doi:10.1109/wcsn.2008.4772690 fatcat:levkerpnlvcb7ndqzsh6pfixau

Shake them up!

Claude Castelluccia, Pars Mutaf
2005 Proceedings of the 3rd international conference on Mobile systems, applications, and services - MobiSys '05  
The proposed protocol works with off-the-shelf 802.11 wireless cards and is secure against eavesdropping attacks that use power analysis.  ...  It requires, however, some firmware changes to protect against attacks that attempt to identify the source of packets from their transmission frequency.  ...  The number of messages per secret bit is reduced (1 instead of 4), making the protocol more energy efficient.  ... 
doi:10.1145/1067170.1067177 dblp:conf/mobisys/CastellucciaM05 fatcat:xdzm5z533rfvhkdgo7fymnidbu

Deniable Internet Key Exchange [chapter]

Andrew C. Yao, Yunlei Zhao
2010 Lecture Notes in Computer Science  
The IPsec and IKE are intended to protect messages communicated in the IP layer, i.e., "layer 3" of ISO-OSI, that processes the transmission of messages using the network addresses possibly without knowing  ...  Note that IPsec and IKE are intended to protect communication protocols in the IP layer that processes the transmission of messages using network addresses (rather than end-uses' IDs).  ...  After receiving the first-round message from A, (X = g x , H(g ax )), A sends back (Y = X −1 , h 2 = H(1)) as the second-round message.  ... 
doi:10.1007/978-3-642-13708-2_20 fatcat:hqbabyc5f5avzkz75hd4j3utjy

Efficient Steganography with Provable Security Guarantees [chapter]

Aggelos Kiayias, Yona Raekow, Alexander Russell
2005 Lecture Notes in Computer Science  
The employment of a pseudorandom number generator (PRNG) allows the transmission of longer messages in the same way that such a generator allows the use of one-time pad encryption for messages longer than  ...  We provide a new provably-secure steganographic encryption protocol that is proven secure in the complexity-theoretic framework of Hopper et al.  ...  (Note also that pseudorandom functions utilized in the above scheme have security no better than 2 −k with security parameter k.)  ... 
doi:10.1007/11558859_10 fatcat:zcq755vnrnhgjnm4ytnvmascxm

Physical key-protected one-time pad [article]

Roarke Horstmeyer, Benjamin Judkewitz, Ivo Vellekoop, Sid Assawaworrarit, Changhuei Yang
2013 arXiv   pre-print
We describe an encrypted communication principle that can form a perfectly secure link between two parties without electronically saving either of their keys.  ...  Beyond the demonstrated communication scheme, our ability to securely couple the randomness contained within two unique physical objects may help strengthen the hardware for a large class of cryptographic  ...  R.H. designed the experiment, built the setup, collected the data, and performed data and security analysis. All authors collectively wrote the manuscript.  ... 
arXiv:1305.3886v2 fatcat:ewmsah5mtjckzjnu56i2g4joh4

Efficient Steganography with Provable Security Guarantees [article]

Aggelos Kiayias, Yona Raekow, Alexander Russell, Narasimha Shashidhar
2009 arXiv   pre-print
The employment of a pseudorandom generator (PRG) permits secure transmission of longer messages in the same way that such a generator allows the use of one-time pad encryption for messages longer than  ...  security guarantees.  ...  One-time stegosystem security is based on the indistinguishability between a transmission that contains a steganographically embedded message and a transmission that contains no embedded messages.  ... 
arXiv:0909.3658v1 fatcat:ke6zulsyevdjfbmrzga4ehutr4

Practical and Provably Secure Onion Routing [article]

Megumi Ando and Anna Lysyanskaya and Eli Upfal
2021 arXiv   pre-print
For security parameter λ, our differentially private solution for the active adversary takes O(log^2λ) rounds and requires every participant to transmit O(log^4λ) onions in every round.  ...  The goal is to make it hard to establish who sent the message. It is a practical and widespread tool for creating anonymous channels.  ...  After the final round, party i outputs the set of messages revealed from processing its the onions it receives at round L + 1. Correctness and efficiency.  ... 
arXiv:1706.05367v3 fatcat:v53qe4rpuzagdgihbt77uvw7cq

Secure Cloud Auditing Over Encrypted Data

Yesu Ragavi Kannadasan
2018 Internet of Things and Cloud Computing  
The proposed scheme combines the encrypting mechanism.  ...  However storing data on cloud imposes certain security challenges. Outsourcing data in cloud result may lose physical control over their data.  ...  In fact, no encryption technique is even perfectly secure from an attack by a realistic cryptanalyst.  ... 
doi:10.11648/j.iotcc.20180601.14 fatcat:texrhx2f6nfbdnwkeq4hwogypy

On Track of Sigfox Confidentiality with End-to-End Encryption

Radek Fujdiak, Petr Blazek, Konstantin Mikhaylov, Lukas Malina, Petr Mlynek, Jiri Misurec, Vojtech Blazek
2018 Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES 2018  
The results herein presented are useful for understanding the cost of enabling security aspects and enable selecting the most efficient encryption protocol.  ...  We provide a brief security assessment of this technology and highlight the main security imperfections.  ...  Theorem A.2. The algorithm OTP is a perfectly secure encryption scheme. Proof. Lets define M = {0, 1} n , where n stands for number of messages.  ... 
doi:10.1145/3230833.3232805 dblp:conf/IEEEares/FujdiakBMMMMB18 fatcat:y24dvere5nchxf6zvs73wptj6a

A brief introduction of quantum cryptography for engineers [article]

Bing Qi, Li Qian, Hoi-Kwong Lo
2010 arXiv   pre-print
Another important topic that is covered here is the study of the security of practical QKD systems.  ...  Bearing in mind that the majority of our readers are from engineering and experimental optics, we focus more on the experimental implementation of various QKD protocols rather than security analysis.  ...  Quantum state transmission 2.  ... 
arXiv:1002.1237v2 fatcat:isqgjbjgurdr7emy4jnhnbtipe
« Previous Showing results 1 — 15 out of 3,914 results