Filters








60 Hits in 3.4 sec

Cryptographic Protocols under Quantum Attacks [article]

Carolin Lunemann
2011 arXiv   pre-print
We study the security of quantum and classical protocols against adversaries that are assumed to exploit quantum effects to their advantage.  ...  But moreover, we encounter additional setbacks in the security proofs, which are mostly due to the fact that some well-known classical proof techniques are forbidden by certain properties of a quantum  ...  Acknowledgments Thanks to all the people, I met on the way of my PhD education, for introducing me to new ways of thinking, inspiring me by fascinating ideas, and helping me in so many other ways.  ... 
arXiv:1102.0885v2 fatcat:y4ytrigbzzf3vb7pwxw3skoh4u

Authentication Based on Non-Interactive Zero-Knowledge Proofs for the Internet of Things

Francisco Martín-Fernández, Pino Caballero-Gil, Cándido Caballero-Gil
2016 Sensors  
The proposal is based on the concept of a non-interactive zero-knowledge proof, so that in a single communication, relevant data may be inferred to verify the legitimacy of the sender.  ...  The proposal has been fully developed for platforms built on the Android Open Source Project, so it can be used in any device or sensor with this operating system.  ...  polynomial time) can be used to describe non-interactive zero-knowledge proofs.  ... 
doi:10.3390/s16010075 pmid:26751454 pmcid:PMC4732108 fatcat:yzoulcovn5fr7hoamhtr6kog2e

Practical yet universally composable two-server password-authenticated secret sharing

Jan Camenisch, Anna Lysyanskaya, Gregory Neven
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
proof.  ...  The highly distributed setting of multi-user and multi-server protocols further complicates the models and proofs. Secure composition is another issue.  ...  Acknowledgments We thank Kristiyan Haralambiev, Stas Jarecki, Anja Lehmann, Victor Shoup, and the anonymous referees for their valuable feedback and comments on earlier versions of this work.  ... 
doi:10.1145/2382196.2382252 dblp:conf/ccs/CamenischLN12 fatcat:nhkkyvwgdbd77jmhoxlx43rmfe

A New Approach for Anonymous Password Authentication

Yanjiang Yang, Jianying Zhou, Jian Weng, Feng Bao
2009 2009 Annual Computer Security Applications Conference  
In this paper, we propose a new and efficient approach for anonymous password authentication.  ...  We present a concrete scheme, and get over a number of challenges in securing passwordprotected credentials against off-line guessing attacks.  ...  A Zero-knowledge Proof of Knowledge protocol (we call it zero-knowledge proof for short) is a two-party three-round protocol, where a prover proves to a verifier the knowledge of a secret without disclosing  ... 
doi:10.1109/acsac.2009.26 dblp:conf/acsac/YangZWB09 fatcat:oqlv6fnek5e2niu5bdx5bzkf3e

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering [chapter]

Rosario Gennaro, Anna Lysyanskaya, Tal Malkin, Silvio Micali, Tal Rabin
2004 Lecture Notes in Computer Science  
In this paper we propose a theoretical framework to investigate the algorithmic aspects related to tamper-proof security.  ...  We prove that these additions are necessary and also sufficient for most common cryptographic primitives, such as encryption and signature schemes.  ...  Finally, we thank Charanjit Jutla, Hugo Krawczyk, and Adi Shamir for participating in the lunch-time conversation where the initial seeds for this work were planted.  ... 
doi:10.1007/978-3-540-24638-1_15 fatcat:wifjz2dcmjellpyswovgdca5qu

Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys [chapter]

Benoît Libert, Damien Vergnaud
2009 Lecture Notes in Computer Science  
The latter scheme is unfortunately far less efficient in terms of decryption cost and ciphertext size.  ...  In this model, if the Private Key Generator (PKG) maliciously re-distributes users' decryption keys, it runs the risk of being caught and prosecuted.  ...  Acknowledgements We thank Duong Hieu Phan and the anonymous referees for their comments.  ... 
doi:10.1007/978-3-642-00468-1_14 fatcat:kkkxxvwsgnddfdalolrdurqvui

Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment [chapter]

Jan Camenisch, Anja Lehmann, Anna Lysyanskaya, Gregory Neven
2014 Lecture Notes in Computer Science  
We make the minimal requirement that the user has a clean operating system and a clean web browser to work with, with hardcoded keys of root certification authorities (CAs) and an implementation of our  ...  The secret can be used as a key for any other cryptographic purposes, for example, to encrypt and store a file in the cloud containing strong passwords and other credentials required for websites or online  ...  Simulation-sound zero-knowledge proof system: We further need a non-interactive zero-knowledge (NIZK) proof system to prove certain relations among different ciphertexts.  ... 
doi:10.1007/978-3-662-44381-1_15 fatcat:5oa53jqkazczdi6xa57w2s6dka

Highly-Efficient and Composable Password-Protected Secret Sharing (Or: How to Protect Your Bitcoin Wallet Online)

Stanislaw Jarecki, Aggelos Kiayias, Hugo Krawczyk, Jiayu Xu
2016 2016 IEEE European Symposium on Security and Privacy (EuroS&P)  
Thus, PPSS schemes are ideal for on-line storing of valuable secrets when retrieval solely relies on a memorizable password.  ...  computation and communication complexity over that scheme requiring a single per-server exponentiation for the client and a single exponentiation for the server.  ...  This work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and NSF grant #CNS-1523467.  ... 
doi:10.1109/eurosp.2016.30 dblp:conf/eurosp/JareckiKKX16 fatcat:hog7juabx5h7pbsr5atmmrzea4

Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys [article]

Benoît Libert, Damien Vergnaud
2009 arXiv   pre-print
The latter scheme is unfortunately far less efficient in terms of decryption cost and ciphertext size.  ...  In this model, if the Private Key Generator (PKG) maliciously re-distributes users' decryption keys, it runs the risk of being caught and prosecuted.  ...  In Goyal -1, users rather send a deterministic (and thus non-statistically hiding) commitment and knowledge of the underlying value must be proven in zero-knowledge because a proof of knowledge of a discrete  ... 
arXiv:0807.1775v5 fatcat:s2255mbhrbejxjqanwxdywcgim

Mixing Strategies in Cryptocurrencies and An Alternative Implementation [article]

Xinyuan Zhang
2020 arXiv   pre-print
Many attacks demonstrate ways to deanonymize people through observing the transaction patterns or network interactions.  ...  Eth-Tumbler utilizes layered encryption and multiple signatures and thus efficiently hides a user under k-anonymity.  ...  The link between the payer and payee is hidden by the zero-knowledge proof.  ... 
arXiv:2010.01670v1 fatcat:mi5tvycqdjdrxkbjyuiuywpd5a

Optimal Distributed Password Verification

Jan Camenisch, Anja Lehmann, Gregory Neven
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
In spite of its simplicity, our scheme boasts security against dynamic and transient corruptions, meaning that servers can be corrupted at any time and can recover from corruption by going through a non-interactive  ...  Initialization additionally requires a secure message to each server, but the refresh procedure is non-interactive.  ...  We would also like to thank Marc Bütikofer, Robin Künzler, Christoph Lucas, and Adrian Schneider for their feedback and implementing our protocol at Ergon.  ... 
doi:10.1145/2810103.2813722 dblp:conf/ccs/CamenischLN15 fatcat:thskmh7ginetxmyk4ae3u67v3a

Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys

Benoît Libert, Damien Vergnaud
2011 IEEE Transactions on Information Theory  
Since the resulting system inherits the efficiency of Gentry's IBE scheme and the Goyal -1 white-box A-IBE scheme, it turns out to be the most efficient weakly black-box A-IBE construction to date.  ...  proposed scheme is the first A-IBE that meets all security properties (although traceability is only guaranteed in the weak black-box model) in the adaptive-ID sense. achieve this goal by means of an interactive  ...  In Goyal -1, users rather send a deterministic (and thus non-statistically hiding) commitment and knowledge of the underlying value must be proven in zero-knowledge because a proof of knowledge of a discrete  ... 
doi:10.1109/tit.2011.2161958 fatcat:daygk6tvr5bobfptwklhd6mtxq

Geofences on the Blockchain: Enabling Decentralized Location-Based Services

Friedhelm Victor, Sebastian Zickau
2018 2018 IEEE International Conference on Data Mining Workshops (ICDMW)  
We evaluate the location encoding systems on their ability to model city geofences and mobile network cell position estimates and analyze the costs associated with storing and evaluating received oracle-positions  ...  The approach relies on existing location encoding systems like Geohashes and S2 cells that can transform polygons into a grid of cells.  ...  In order to improve privacy aspects, it may be of interest to determine whether zero knowledge proofs can be combined with geofences in smart contracts.  ... 
doi:10.1109/icdmw.2018.00021 dblp:conf/icdm/VictorZ18 fatcat:mqspakoycffonjoppvbh3cu6ym

Provably secure threshold password-authenticated key exchange

Mario Di Raimondo, Rosario Gennaro
2006 Journal of computer and system sciences (Print)  
Moreover our protocols are reasonably efficient and implementable in practice. In particular a goal of the design was to avoid costly zero-knowledge proofs to keep interaction to a minimum.  ...  The goal is to protect the password against hackers attacks that can break into the authenticating server and steal password information.  ...  Acknowledgments: Thanks to Phil MacKenzie for invaluable comments at various stages of this project, Yehuda Lindell for enlightening conversations about password protocols and Stas Jarecki for very helpful  ... 
doi:10.1016/j.jcss.2006.02.002 fatcat:qln6x7tk5fcedjfy5tnyxu3u4a

Mutual zero-knowledge authentication based on virtual passwords per session (MAVPS)

Younes Asimi, Abdellah Amghar, Ahmed Asimi, Yassine Sadqi
2014 2014 Second World Conference on Complex Systems (WCCS)  
In this paper, we introduce a new strong zero knowledge authentication system based on virtual passwords (SAVP).  ...  Our goal is to provide a strong zero knowledge authentication system based on salts generated by a cryptographically secure random regenerator, algorithm for dynamic rotation of binary strings, symmetric  ...  Zero-Knowledge Proof The concept of a proof of zero-knowledge was introduced in the firstly by Goldwasser, Micali and Racko [10] . It is used in cryptography to ensure the identity of users.  ... 
doi:10.1109/icocs.2014.7060878 fatcat:dzkecaxhbzghnmervun3elf5si
« Previous Showing results 1 — 15 out of 60 results