The document provides an overview of a proposed anonymous certification system that uses pseudonyms. Key points:
- It aims to allow users to generate multiple unlinkable pseudonyms from a single master secret key, providing anonymity while still allowing authentication.
- Pseudonyms are generated using an identity generation process that squares the master public key. Certificates are obtained on pseudonyms using an anonymous certification scheme based on blind signatures.
- The system includes protocols for identification, where a user proves possession of a certified pseudonym, and tracing, where a trustee can reveal a user's identity using a verification transcript.
- The security is based on computational assumptions like factoring and the square root problem. Protocols are described
O quanto você está satisfeito com o código que produz? Mais ainda: o quanto você está satisfeito como profissional? Na busca pela melhoria de nossas aplicações, caímos num grande desafio: melhorar a nós mesmos!
Numa conversa franca e descontraída, Samuel e Victor tentarão apresentar idéias sobre como você pode melhorar seu próprio trabalho e sentir orgulho do que faz.
Accelerating Habanero-Java Program with OpenCL GenerationAkihiro Hayashi
Accelerating Habanero-Java Program with OpenCL Generation. Akihiro Hayashi, Max Grossman, Jisheng Zhao, Jun Shirako, Vivek Sarkar. 10th International Conference on the Principles and Practice of Programming in Java (PPPJ), September 2013.
O quanto você está satisfeito com o código que produz? Mais ainda: o quanto você está satisfeito como profissional? Na busca pela melhoria de nossas aplicações, caímos num grande desafio: melhorar a nós mesmos!
Numa conversa franca e descontraída, Samuel e Victor tentarão apresentar idéias sobre como você pode melhorar seu próprio trabalho e sentir orgulho do que faz.
Accelerating Habanero-Java Program with OpenCL GenerationAkihiro Hayashi
Accelerating Habanero-Java Program with OpenCL Generation. Akihiro Hayashi, Max Grossman, Jisheng Zhao, Jun Shirako, Vivek Sarkar. 10th International Conference on the Principles and Practice of Programming in Java (PPPJ), September 2013.
Se guardiamo oltre la meccanica, il TDD è una tecnica complessa perché richiede molteplici skill. Da principiante dopo l’implementazione di poche storie ti imbatti nel problema dei test che si rompono ad ogni refactoring, è arrivato il momento di migliorare i propri skill di scrittura dei test. Nel talk analizzeremo la struttura dei test, quali sono le bad smell più comuni e come porvi rimedio.
We all know, or should know, about SOLID. The question is, do we write C++ according to the SOLID principles?
https://platis.solutions/blog/2020/06/22/how-to-write-solid-cpp/
How Data Flow analysis works in a static code analyzerAndrey Karpov
Data flow analysis is a technology for source code analysis, widely used in various development tools: compilers, linters, IDE. We'll talk about it exemplifying with design of a static analyzer. The talk covers classification and various kinds of data flow analysis, neighbouring technologies supporting each other, obstacles arising during development, surprises from C++ language when one tries to analyze the code. In this talk, some errors, detected in real projects using this technology, are shown in detail.
After enormous cryptocurrencies value gains this year, Blockchain - their underneath algorithm is a topic that gets both a lot of exposure and confusion among developers. In this presentation, I’m going to create a glossary that will guide you in further exploration and sort out your knowledge.
We will discuss not only what Blockchain is but also why it is (or isn’t) the big thing. Everything using easy to grasp JavaScript code examples.
Prepare yourself for surfing on dangerous hype-wave - it’s easy to drown.
Repository of Presentation:
https://github.com/ArturSkowronski/naivechain
Presented:
4Developers Łódź (https://lodz.4developers.org.pl), Kraków, 09.11.2017
KrakowJS (http://conf.krakowjs.pl/), Krakow, 29.09.2017
In this session we will have a closer look at distributed ledger technology and its applications in the modern world.
We will discuss the essential components of a set of technologies that are typically referred to as "Blockchain"
and try to distill these components to their essential parts.
Secondly we will explore two main use-cases, cryptocurrencies like BitCoin, ZCash and GridCoin and smart contract platforms like Ethereum.
Our approach will be critical and technical, the goal of this workshop is to explore and discuss "the blockchain" in a practical and accurate way
The art of reverse engineering flash exploitsPriyanka Aash
"Adobe Flash is one of the battlegrounds of exploit and mitigation methods. As most of the Flash exploits demonstrate native memory layer exploit technique, it is valuable to understand the memory layout and behavior of Adobe Flash Player. We developed fine-grained debugging tactics to observe memory exploit technique and the way to interpret them effectively. This eventually helps defenders to understand new exploit techniques that are used for current targets quickly. This information is also valuable in deciding which area should defenders focus on for mitigation and code fixes. Adobe Flash Player was one of the major attack targets in 2015. We observed at least 17 effective zero-days or 1-day attacks in the wild. Flash is not just used by exploit kits like Angler, it has also been commonly used for advanced persistent threat (APT) attacks. The bug class ranges from simple heap overflows, uninitialized memory to type confusion and use-after-free. At Microsoft, understanding exploits in-the-wild is a continuous process. Flash exploit is one of the hardest to reverse-engineer. It often involves multi-layer obfuscation, and by default, is highly obfuscated and has non-decompilable codes. The challenge with Flash exploit comes from the lack of tools for static and dynamic analysis. Exploits are written with ActionScript programming language and obfuscated in bytecode level using commercial-grade obfuscation tools. Understanding highly obfuscated logic and non-decompilable AVM bytecode is a big challenge. Especially, the lack of usable debuggers for Flash file itself is a huge hurdle for exploit reverse engineers. It is just like debugging PE binaries without using Windbg or Olly debugger. The ability of the researcher is highly limited.
With this presentation, I want to deliver two things: 1. The tactics and debugging technique that can be used to reverse engineer exploits. This includes using existing toolsets and combining them in an effective way. 2. The detailed exploit code reverse engineering examples that can help you understand what's the current and past status of attack and mitigation war. You might have heard of Vector corruption, ByteArray corruption and other JIT manipulation technique. Technical details will be discussed on how the exploits are using these and how the vendor defended against these."
(Source: Black Hat USA 2016, Las Vegas)
PHP Benelux 2012: Magic behind the numbers. Software metrics in practice Sebastian Marek
We use static code analysis tools more often these days that create great reports and funky graphs. But do we understand what it all means?
Software metrics tends to be magic numbers for a lot of people, but they don’t really have to be. Seb will introduce you to a few basic, the most popular software metrics and tools. He will explain to you what they mean and how you can use them to produce better software.
Cloud computing is an ever-growing field in today‘s era.With the accumulation of data and the
advancement of technology,a large amount of data is generated everyday.Storage, availability and security of
the data form major concerns in the field of cloud computing.This paper focuses on homomorphic encryption,
which is largely used for security of data in the cloud.Homomorphic encryption is defined as the technique of
encryption in which specific operations can be carried out on the encrypted data.The data is stored on a remote
server.The task here is operating on the encrypted data.There are two types of homomorphic encryption, Fully
homomorphic encryption and patially homomorphic encryption.Fully homomorphic encryption allow arbitrary
computation on the ciphertext in a ring, while the partially homomorphic encryption is the one in which
addition or multiplication operations can be carried out on the normal ciphertext.Homomorphic encryption
plays a vital role in cloud computing as the encrypted data of companies is stored in a public cloud, thus taking
advantage of the cloud provider‘s services.Various algorithms and methods of homomorphic encryption that
have been proposed are discussed in this paper
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
Se guardiamo oltre la meccanica, il TDD è una tecnica complessa perché richiede molteplici skill. Da principiante dopo l’implementazione di poche storie ti imbatti nel problema dei test che si rompono ad ogni refactoring, è arrivato il momento di migliorare i propri skill di scrittura dei test. Nel talk analizzeremo la struttura dei test, quali sono le bad smell più comuni e come porvi rimedio.
We all know, or should know, about SOLID. The question is, do we write C++ according to the SOLID principles?
https://platis.solutions/blog/2020/06/22/how-to-write-solid-cpp/
How Data Flow analysis works in a static code analyzerAndrey Karpov
Data flow analysis is a technology for source code analysis, widely used in various development tools: compilers, linters, IDE. We'll talk about it exemplifying with design of a static analyzer. The talk covers classification and various kinds of data flow analysis, neighbouring technologies supporting each other, obstacles arising during development, surprises from C++ language when one tries to analyze the code. In this talk, some errors, detected in real projects using this technology, are shown in detail.
After enormous cryptocurrencies value gains this year, Blockchain - their underneath algorithm is a topic that gets both a lot of exposure and confusion among developers. In this presentation, I’m going to create a glossary that will guide you in further exploration and sort out your knowledge.
We will discuss not only what Blockchain is but also why it is (or isn’t) the big thing. Everything using easy to grasp JavaScript code examples.
Prepare yourself for surfing on dangerous hype-wave - it’s easy to drown.
Repository of Presentation:
https://github.com/ArturSkowronski/naivechain
Presented:
4Developers Łódź (https://lodz.4developers.org.pl), Kraków, 09.11.2017
KrakowJS (http://conf.krakowjs.pl/), Krakow, 29.09.2017
In this session we will have a closer look at distributed ledger technology and its applications in the modern world.
We will discuss the essential components of a set of technologies that are typically referred to as "Blockchain"
and try to distill these components to their essential parts.
Secondly we will explore two main use-cases, cryptocurrencies like BitCoin, ZCash and GridCoin and smart contract platforms like Ethereum.
Our approach will be critical and technical, the goal of this workshop is to explore and discuss "the blockchain" in a practical and accurate way
The art of reverse engineering flash exploitsPriyanka Aash
"Adobe Flash is one of the battlegrounds of exploit and mitigation methods. As most of the Flash exploits demonstrate native memory layer exploit technique, it is valuable to understand the memory layout and behavior of Adobe Flash Player. We developed fine-grained debugging tactics to observe memory exploit technique and the way to interpret them effectively. This eventually helps defenders to understand new exploit techniques that are used for current targets quickly. This information is also valuable in deciding which area should defenders focus on for mitigation and code fixes. Adobe Flash Player was one of the major attack targets in 2015. We observed at least 17 effective zero-days or 1-day attacks in the wild. Flash is not just used by exploit kits like Angler, it has also been commonly used for advanced persistent threat (APT) attacks. The bug class ranges from simple heap overflows, uninitialized memory to type confusion and use-after-free. At Microsoft, understanding exploits in-the-wild is a continuous process. Flash exploit is one of the hardest to reverse-engineer. It often involves multi-layer obfuscation, and by default, is highly obfuscated and has non-decompilable codes. The challenge with Flash exploit comes from the lack of tools for static and dynamic analysis. Exploits are written with ActionScript programming language and obfuscated in bytecode level using commercial-grade obfuscation tools. Understanding highly obfuscated logic and non-decompilable AVM bytecode is a big challenge. Especially, the lack of usable debuggers for Flash file itself is a huge hurdle for exploit reverse engineers. It is just like debugging PE binaries without using Windbg or Olly debugger. The ability of the researcher is highly limited.
With this presentation, I want to deliver two things: 1. The tactics and debugging technique that can be used to reverse engineer exploits. This includes using existing toolsets and combining them in an effective way. 2. The detailed exploit code reverse engineering examples that can help you understand what's the current and past status of attack and mitigation war. You might have heard of Vector corruption, ByteArray corruption and other JIT manipulation technique. Technical details will be discussed on how the exploits are using these and how the vendor defended against these."
(Source: Black Hat USA 2016, Las Vegas)
PHP Benelux 2012: Magic behind the numbers. Software metrics in practice Sebastian Marek
We use static code analysis tools more often these days that create great reports and funky graphs. But do we understand what it all means?
Software metrics tends to be magic numbers for a lot of people, but they don’t really have to be. Seb will introduce you to a few basic, the most popular software metrics and tools. He will explain to you what they mean and how you can use them to produce better software.
Cloud computing is an ever-growing field in today‘s era.With the accumulation of data and the
advancement of technology,a large amount of data is generated everyday.Storage, availability and security of
the data form major concerns in the field of cloud computing.This paper focuses on homomorphic encryption,
which is largely used for security of data in the cloud.Homomorphic encryption is defined as the technique of
encryption in which specific operations can be carried out on the encrypted data.The data is stored on a remote
server.The task here is operating on the encrypted data.There are two types of homomorphic encryption, Fully
homomorphic encryption and patially homomorphic encryption.Fully homomorphic encryption allow arbitrary
computation on the ciphertext in a ring, while the partially homomorphic encryption is the one in which
addition or multiplication operations can be carried out on the normal ciphertext.Homomorphic encryption
plays a vital role in cloud computing as the encrypted data of companies is stored in a public cloud, thus taking
advantage of the cloud provider‘s services.Various algorithms and methods of homomorphic encryption that
have been proposed are discussed in this paper
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
AN EFFICIENT PROXY SIGNCRYPTION SCHEME BASED ON THE DISCRETE LOGARITHM PROBLEMZac Darcy
Signcryption is a cryptographic primitive which simultaneously provides both confidentiality and
authenticity in a single logical step. In a proxy signature scheme, an original signer delegates his signing
power to a proxy agent, who signs a message on behalf of him. This paper introduces a new proxy
signcryption scheme based on the Discrete Logarithm Problem (DLP) with a reduced computational
complexity compared to other schemes in literature. In this proposed scheme, the receiver is the only one
who can verify the origin of the ciphertext. Moreover, in this scheme, an authorized proxy signcrypter can
create valid proxy signatures after verifying the identity of the original signcrypter. The proposed scheme
achieves the various desirable security requirements. An elliptic curve based version of the proposed proxy
signcryption scheme has been implemented using Mathematica for realistic (256-bit) parameters to
emphasize the ease of its practical use.
University of Virginia
cs4414: Operating Systems
http://rust-class.org
What happened with Apple's SSL implementation
How to make sure this doesn't happen to you!
Sharing data
ARCs in Rust
Scheduling
For embedded notes, see:
Analysis and improvement of pairing free certificate-less two-party authentic...ijsptm
The predominant grid authentication mechanisms use public key infrastructure (PKI). Nonetheless,
certificate-less public key cryptography (CL-PKC) has several advantages that seem to well align with the
demands of grid computing. Security and efficiency are the main objectives of grid authentication
protocols. Unfortunately, certificate-less authenticated key agreement protocols rely on the bilinear
pairing, that is extremely computational expensive. In this paper, we analyze the recently secure certificateless
key agreement protocols without pairing. We then propose a novel grid pairing-free certificate-less
two-party authenticated key agreement (GPC-AKA) protocol, providing a more lightweight key
management approach for grid users. We also show, a GPC-AKA security protocol proof using formal
automated security analysis Sycther tool.
Using SSL/TLS the right way is often a big hurdle for developers. We prefer to have that one colleague perform "something with certificates", because he/she knows how that works. But what if "that one colleague" is enjoying vacation and something goes wrong with the certificates?
In this session we'll take a close look at secure communication at the transport level. Starting with what exactly SSL and TLS is, we'll dive into public/private keys, and signing. We'll also learn what all this has to do with an unfortunate Dutch notary. Of course, there'll be plenty of practical tips & trics, as well as demo's.
Attend this session to become "that one colleague"!
Certificate less public key cryptography is a design
that is secure against key escrow issue and remove loopholes of
ID based cryptography. Lots of work has been done on CL –DS
yet they depend on bilinear pairing that required more time to
perform pairing operations. Bilinear pairing is executed with
super-singular EC group which is tedious. In this paper we
propose a pairing free ID based Certificate Less Digital Signature
(CL-DS) scheme utilizing elliptic curve cryptography, which
maintain a strategic distance from tedious operations required in
bilinear matching. We improve the security of the previously
proposed scheme with less computation time with time stamp.
Cryptanalysis on Privacy-aware Two-factor Authentication Protocol for Wireles...IJECEIAES
Das first proposed two-factor authentication combining the smart card and password to resolve the security problems of wireless sensor networks (WSNs). After that, various researchers studied two-factor authentication suitable for WSNs. In user authentication protocols based on the symmetric key approach, a number of elliptic curve cryptography (ECC)-based authentication protocols have been proposed. To resolve the security and efficiency problems of ECC-based two-factor authentication protocols, Jiang et al. proposed a privacy-aware two-factor authentication protocol based on ECC for WSNs. However, this paper performs a vulnerability analysis on Jiang et al.’s authentication protocol and shows that it has security problems, such as a lack of mutual authentication, a risk of SID modification and DoS attacks, a lack of sensor anonymity, and weak ID anonymity.
Using SSL/TLS the right way is often a big hurdle for developers. We prefer to have that one colleague perform "something with certificates", because he/she knows how that works. But what if "that one colleague" is enjoying vacation and something goes wrong with the certificates?
In this session we'll take a close look at secure communication at the transport level. Starting with what exactly SSL and TLS is, we'll dive into public/private keys, and signing. We'll also learn what all this has to do with an unfortunate Dutch notary. Of course, there'll be plenty of practical tips & trics, as well as demo's.
Attend this session to become "that one colleague"!
A secure framework for authentication and encryption using improved ECC for I...GauthamSK4
A secure framework for authentication and encryption for IoT based medical sensor data. The security is provided with substitution-caser cipher along with improved ECC.
Outsourcing of scientic computations is attracting increasing attention since it enables the customers with limited computing resource and storage devices to outsource the sophisticated computation workloads into powerful service providers. However, it also comes up with some security and privacy concerns and challenges, such as the input and output privacy of the customers, and cheating behaviors of the cloud. Motivated by these issues, this paper focused on privacy-preserving Linear Fractional Programming (LFP) as a typical and practically relevant case for veriable secure multiparty computation. We will investigate the secure and veriable schema with correctness guarantees, by using normal multiparty techniques to compute the result of a computation and then using veriable techniques only to verify that this result was correct.
The Secure Socket Layer protocol was created by Netscape to ensure secure transactions between web servers and browsers.
Most certificates in common use are based on the X.509 v3 certificate standard. First I open the shell with the openssl.exe and MS SDK tools.
Symmetric cryptography will always produce the same ciphertext if the plaintext and the given key are the same repeatedly. This condition will make it easier for cryptanalysts to perform cryptanalysis. This research introduces a one-to-many cryptography scheme, which can produce different ciphertexts even if the input given is the same repeatedly. The one-to-many encryption scheme can produce several ciphertexts with differences of up to 50%. The avalanche effect test obtained an average of 52.20%, better than modern cryptography Blowfish by 25.46% and 6% better than advanced encryption standard (AES). One-to-many can produce different n-ciphertexts, which will certainly make it more difficult for cryptanalysts to perform cryptanalysis and require n-times longer to break than other symmetric cryptography.
Using SSL/TLS the right way is often a big hurdle for developers. We prefer to have that one colleague perform "something with certificates", because he/she knows how that works. But what if "that one colleague" is enjoying vacation and something goes wrong with the certificates?
In this session we'll take a close look at secure communication at the transport level. Starting with what exactly SSL and TLS is, we'll dive into public/private keys, and signing. We'll also learn what all this has to do with an unfortunate Dutch notary. Of course, there'll be plenty of practical tips & trics, as well as demo's.
Attend this session to become "that one colleague"!
Certificate less key management scheme inIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (ID-PKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
CERTIFICATE LESS KEY MANAGEMENT SCHEME IN MANET USING THRESHOLD CRYPTOGRAPHYIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (IDPKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
Similar to Certified Pseudonym Colligated with Master Secret Key (20)
Welocme to ViralQR, your best QR code generator.ViralQR
Welcome to ViralQR, your best QR code generator available on the market!
At ViralQR, we design static and dynamic QR codes. Our mission is to make business operations easier and customer engagement more powerful through the use of QR technology. Be it a small-scale business or a huge enterprise, our easy-to-use platform provides multiple choices that can be tailored according to your company's branding and marketing strategies.
Our Vision
We are here to make the process of creating QR codes easy and smooth, thus enhancing customer interaction and making business more fluid. We very strongly believe in the ability of QR codes to change the world for businesses in their interaction with customers and are set on making that technology accessible and usable far and wide.
Our Achievements
Ever since its inception, we have successfully served many clients by offering QR codes in their marketing, service delivery, and collection of feedback across various industries. Our platform has been recognized for its ease of use and amazing features, which helped a business to make QR codes.
Our Services
At ViralQR, here is a comprehensive suite of services that caters to your very needs:
Static QR Codes: Create free static QR codes. These QR codes are able to store significant information such as URLs, vCards, plain text, emails and SMS, Wi-Fi credentials, and Bitcoin addresses.
Dynamic QR codes: These also have all the advanced features but are subscription-based. They can directly link to PDF files, images, micro-landing pages, social accounts, review forms, business pages, and applications. In addition, they can be branded with CTAs, frames, patterns, colors, and logos to enhance your branding.
Pricing and Packages
Additionally, there is a 14-day free offer to ViralQR, which is an exceptional opportunity for new users to take a feel of this platform. One can easily subscribe from there and experience the full dynamic of using QR codes. The subscription plans are not only meant for business; they are priced very flexibly so that literally every business could afford to benefit from our service.
Why choose us?
ViralQR will provide services for marketing, advertising, catering, retail, and the like. The QR codes can be posted on fliers, packaging, merchandise, and banners, as well as to substitute for cash and cards in a restaurant or coffee shop. With QR codes integrated into your business, improve customer engagement and streamline operations.
Comprehensive Analytics
Subscribers of ViralQR receive detailed analytics and tracking tools in light of having a view of the core values of QR code performance. Our analytics dashboard shows aggregate views and unique views, as well as detailed information about each impression, including time, device, browser, and estimated location by city and country.
So, thank you for choosing ViralQR; we have an offer of nothing but the best in terms of QR code services to meet business diversity!
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Certified Pseudonym Colligated with Master Secret Key
1. Certified Pseudonym
Colligated
with Master Secret Key
!
Vijay Pasupathinathan Macquarie University, Sydney.
joint work with
Josef Pieprzyk, Macquarie University, Sydney.
and, Huaxiong Wang, NTU, Singapore.
2. Outline
๏
Introduction
๏ Why a new system?
๏ Contribution
๏
How to achieve?
๏ Anonymous Certification systems
๏
Proposed Protocol
๏ Assumptions
๏ Protocol settings
๏ Security
๏
Applications, Advantages and open problem
3. What is a Pseudonym?
!
!
A mechanism to hide a user’s identity by providing anonymity,
while being still suitable to authenticate the holder of the
pseudonym in a communication system. (Chaum, 1985).
4. How are they achieved?
๏ Chaum and Evertse (1986) developed a pseudonym
system and proposed an RSA based implementation
while relying on a trusted centre who must sign all
credentials.
๏ Chen (1995) extended the scheme and presented its
discrete-logarithm version that relies on a trusted centre.
๏ However, these schemes have a common
weakness. Although the identity of the user is
hidden, the credentials (such as certificates of
his/her public key) or pseudonyms can be
easily shared (unauthorised transfer) with other
users.
5. How are they achieved? part 2
๏ Based on security of preserving a high-value (master) secret key,
Canettie et al. (2000) and Lysayanskaya et al.(1999)
independently proposed non-transferable pseudonym systems.
๏ Security is also based on the idea that “to force a user to reveal
the master secret key if they choose to share their credentials”.
๏ The problem is during the registration phase, users are required
to disclose their true identity (master public key) to a CA.
๏ Makes them prone to collusion between a CA and a Verifier.
6. What do we want!
๏ Pseudonym system based on a single trusted master
secret-public key pair.
๏ Pseudonyms should be independent of the master
public key. (Anonymity)
๏ Ability to generate multiple pseudonyms easily from a
single trusted secret-key. (Colligation)
๏ Verifiable using certificates that were issued against
pseudonyms.
7. Desired System
Pseudonym 1
Pseudonym 2
User
Trusted
SK0/PK0
SK0
PK 1
PK 2
.
.
.
Pseudonym i
Cert<PK1>
PK i
.
.
.
Pseudonym n
Certifier
PK n
Cert<PK2>
.....
Cert<PKn>
8. Desired System
Pseudonym 1
PK 1
Certifier
Cert<PK1>
User
Trusted
SK0/PK0
SK0
SK0{M}
PK 1
?
Cert<PK1>
Verify Message
using PK1
Think as group signatures looking through a mirror!
Verifier
9. Proposed Protocol
๏ Make use of an ACS (to certify pseudonyms)
๏ Make use of squaring (to provide colligation)
๏ There exits an underlying link between all pseudonyms
and the root secret key.
10. Anonymous Certification System
๏ Anonymous certification system (ACS) represents the
certification process of a public key by a certifier who
does not know the public key.
๏ This could essentially be a blind signature on the public
key of the user.
๏ That is, it provides anonymity to the receiver.
๏ Whereas, group signature schemes as employed by
provide anonymity to the source.
11. Anonymous Certification System
๏ Consists of four (4) entities: a user, verifier, certifier and a
trustee (tracer).
๏ The protocol suites include:
๏ a certification protocol, where an user interacts with the certifier to
obtain a certified pseudonym, i.e., the pseudonym is blindly
signed.
๏ An identification protocol, where verifier interacts with the user to
authenticate the user's credential and provide services.
๏ A trace protocol, where the trustee participates and is invoked to
trace the real identity associated with the user's pseudonym.
12. Security Assumptions
๏ Factoring: The probability that any probabilistic
polynomial time algorithm, can factor a composite
formed from two primes is negligible.
๏ Square Root: the probability that a probabilistic
polynomial time algorithm can output b such that b2 ≡ a
mod N, where a ∈ QRN, is negligible.
๏ Square Decisional Diffie-Hellmann: Distinguish between
distributions of the form (g, ga , ga2) from (g, ga , gr),
where r is random and uniformly chosen. We assume
that there is no probabilistic polynomial-time algorithm
that can solve a random instance of the SDDH problem.
13. The U master public-secret key-pair is generated
as in Section 2.1.1. U then obtains a certificate on the
master public key PKU 0 from a certification authority
C , which represents the U ’s true identity.
The public key of the certification authority is
obabilistic
SKC and the trustee is PK = gSKT , where
PKC = g
T
1
on input NAn user and SK are the corresponding secret keysthe
SKC generates new identities using for
๏
T
two prime
the certification authority
generation process and the trustee respectively.
a quadratic
put b, such
3.2 Identity Generation
๏ Which takes the inputs,
e probabil-
gorithm A ,
negligible
maller than
al Diffiee-Hellman
ws. Disthe form
andom and
N − 1}. We
olynomiala random
probability
onstruction
Identity Generation
following key
U generates secret key.
๏ Nj, g, master new identities using the following key
generation process, which takes the inputs, N j , g, a
counter value i i (indicating the total number new
๏ a counter value(indicating the total number of of new identities being
identities being generated), identity level l (number
generated),
of identities generated previously) and the master
๏ identity level U(number of identities generated previously).
secret key SKl 0 .
I-Generation(g,i,l,SKU 0 )
2
SKU
For j = l,. . . ,i do PKU j = g
Return(PKU l ,. . . ,PKU j )
j
0
mod N j EndFor
During the first run the value of identity level l
14. r user
aining
raphic
s.
ter public key is certified by the manufacturer,
and the following describes the certification of the
pseudonyms.
The user, U , generates pseudonyms of the form
Certifier
User
๏ A modified Certification scheme
(PKU 1 , . . . , PKU l ) using the identity generation pror∈ Z
based on blind signature
x = PK cess described in Section 3.2. The user then identifies
g
−−−−−−
−−−−−→
scheme by (Pointcheval, 2000)
β, γ, s ∈ Z
himself/herself (using, s)the master public key) to the
(X, Y ) = EncElg
(P K
PK
α = x ·engages
g
certifier andIHI(PK ∥(X,· Y )∥α) in a ๏ Signature scheme now includes
certify protocol to obtain a
δ=
=δ−
the . The public key of i
certificate e on γa pseudonym PKU i mastervalue of PKUthe
←−−−−−
−−−−−−
y = r − eSK
user which is used by the
is −−−−−−−−−−−→
never revealed to the certifier. We shall express this
certifier to form the
=
phase as x = yg + β P K
ρ
Certification
User
m
R
N0
r
U0
a1 =
g w ; a2
x
Verifier
k, w ∈R ZNi
= (PKT · PKU0 )w
k
h = I I(g 2 )
H
h,(a1 ,a2 ),(X,Y )
−−−−−−
−−−−−→
R
nts the
er who
ially a
public
he re-
N0
β−SKU
P KT
−γ
C
0
c1 ∈R ZNi
c2 = I I(X, Y, a1 , a2 )
H
U0
c1 ,c2
←−−−−−
−−−−−−
i
z1 = 2k − c1 · SK2 0
U
Ui
z1 ,z2 ,CERTC ⟨P KU ⟩
z2 = w − s · c2 − − − − − −i
−−−−−→
e
Verify CERTC ⟨P KUi ⟩
and obtain (α, δ)
C
y
?
?
y+SKU
δ ′ = I I(PKUi ∥(X, Y )∥α)
H
?
a1 = g z2 X c2 ; a2 = PKz2 Y c2
T
e
C
0
commitment and is later verified
by the , C ,
Figure 1: (PKU , CERTC ⟨PKU ⟩) ← Certi f y(Uuser.CERTC ⟨PKU ⟩)
Modified Blind Certification Protocol of
Figure 2: Identification Protocol
i
i
0
(Pointcheval, 2000) - The signature on PK is (α, δ, ρ) and
?
c
h = I I(g z P KUi )
H
Ui
d threea receiver can verify using the relation α = g PKC
between the verifier V and the trustee T . To trigger
i.e. “ U (e.g. applications in the certify protocol with C protocol parengages based on the protocol V has to provide proof of usfier V ,but certain applications
TPM) require the new identities to beU ⟩ to obtain a certificate on PKU ,
ing CERTC ⟨PK protected even ticipation by U . We shall express this phase as
0
otocolfrom the certifier. So, we propose a modification to (PKU ) ← Trace(V , T , PKU , CERTC ⟨PKU ⟩,i⟨PROOFU ⟩)
CERTC ⟨PKU i ⟩”.
the certification scheme based on a blind signature
U in-scheme using a composite modulus by Pointcheval
2000). The blind
scheme now
.e. the(Pointcheval,master public keysignatureuser which is
includes the
the
2.1.3 to form theofcommitment and is
Protocol Identify
proto-used by the certifier
?
ρ
δ
i
0
Verifier
i
Trustee
σ = SIGNV ⟨c, z, h⟩
σ,α,δ,ρ,PKU ,PKC
i
i
15. ol
ne
oee
y
U0 , s)
=
h
d on
even
s
on to
ature
rheval
now
e
ch is
nd is
us
ol of
) and
i
0
CERTC ⟨PKU i ⟩”.
Identification Protocol
2.1.3 Protocol Identify
๏ Based offered by a
A user U who wishes to avail serviceson Pointcheval
verifier V , engages in a identification protocol to conoptimised identification
vince that he/she possess the necessary (Pointcheval,
scheme credentials.
We shall express this phase as 2000)
User
Verifier
k, w ∈R ZNi
a1 = g w ; a2 = (PKT · PKU0 )w
k
h = I I(g 2 )
H
h,(a1 ,a2 ),(X,Y )
−−−−−−
−−−−−→
c1 ∈R ZNi
c2 = I I(X, Y, a1 , a2 )
H
c1 ,c2
←−−−−−
−−−−−−
i
z1 = 2k − c1 · SK2 0
U
z1 ,z2 ,CERTC ⟨P KU ⟩
z2 = w − s · c2 − − − − − −i
−−−−−→
Verify CERTC ⟨P KUi ⟩
and obtain (α, δ)
๏ Now also includes the DLEQ logg C = log ⟩, Y
⟨PROOFU i ⟩ ← Identi f y(U , V , PKU i , CERTX ⟨PKU iPKTPKT )
?
δ ′ = I I(PKUi ∥(X, Y )∥α)
H
?
a1 = g z2 X c2 ; a2 =
?
c
h = I I(g z P KUi )
H
PKz2 Y c2
T
Figure 2: Identification Protocol
i.e. “ U engages in an identification protocol with
a verifier V using the psuedonymn PKU i and
(PKCERT ⟨PK , ⟩ and ⟩, ⟨PROOF ⟩) contains the encryption of
) ← Trace(V , T , PK CERT ⟨PK which
C
Ui
the identity under the public key PKT ”.
between the verifier V and the trustee T . To trigger
the protocol V has to provide proof of protocol participation by U . We shall express this phase as
U0
Ui
Verifier
C
Ui
Trustee
σ = SIGNV ⟨c, z, h⟩
σ,α,δ,ρ,PKU ,PKC
2.1.4 Protocol Trace
−−−−−−
− − − −i − →
CERTC ⟨P KUi ⟩
VERIFY
⟨σ⟩
Ui
16. ρ) and
sed on
d even
ion to
nature
cheval
me now
hich is
and is
nature
ccomFigure
ol trivl’s pa-
based
cheme
cheme
DL-EQ
ses his
with a
verifier
in the
ted by
Figure 2: Identification Protocol
⟩ the trustee T . To trigger
CERTC ⟨PKU iand and which contains the encryption of
between the verifier V
the
provide proof
theprotocol V .has to under thisof protocol par- key PKT ”.
identityshall express the public
ticipation by U We
phase as
Tracing Protocol
(PKU 0 ) ← Trace(V , T , PKU i , CERTC ⟨PKU i ⟩, ⟨PROOFU i ⟩)
2.1.4 Protocol Trace
Verifier
Trustee
σ = SIGNV ⟨c, z, h⟩
๏ Invoked by a verifier after a user
has misused a pseudonym.
A verifier who needs to trace the identity of the user
๏ Verifier provides proof of a
contacts the trustee T by providing with the transcript
users participation.
from an identification protocol ⟨PROOFU i ⟩. We shall
๏ Trustee can reveal a user’s
express this phase as
σ,α,δ,ρ,PKU ,PKC
−−−−−−
− − − −i − →
CERTC ⟨P KUi ⟩
VERIFYPKV ⟨σ⟩
?
h = I I(g z PKc i )
H
U
?
α = g ρ PKδ
C
Verify CERTC ⟨P KUi ⟩
Obtain (X, Y ) from ⟨PROOFUi ⟩
P KU0 = DecElgSK (X, Y )
T
Figure 3: Tracing Protocol
master public key.
(PKU 0 ) ← Trace(V , T , PKU i , CERTC ⟨PKU i ⟩, ⟨PROOFU i ⟩)
4 SECURITY
i.e. “ V engages in the tracing protocol with T using
4.1 Adversary Goals
the values PKU i , CERTC ⟨PKU i ⟩ and proof of identity
We assume an active adversary A , who is capable of
use ⟨PROOFU i ⟩ messages in the commu- master identity PKU 0 ”.
eavesdropping and injecting to obtain the
nication medium. We also assume that an adversary
may be also be a legitimate (but dishonest) participant
in a protocol, i.e. either the certifier or the verifier or
both may be dishonest.
As in (Damgard, 1988; Lysyanskaya et al., 1999),
17. Security
๏ The proposal is secure against (as identified by Damgard,
1988; Lysyanskaya,1999):
๏ Pseudonym forgery: where an adversary tries to forge a
pseudonym for some user.
๏ Identity compromise: An adversary in association with
other participants tries to obtain information regarding the
user's master public-secret key-pair
๏ Pseudonym linking and colligation: An adversary tries to
obtain information that links a pair of pseudonyms to the
same user or to a user's master public key.
18. Application to TPM
๏ We are considering a TPM setting because of tamper resistant
protection offered to the master secret key, but the protocols
can be applied to other structures like directory based services
(e.g. active directory, LDAP)
๏ The endorsement (EK) in a TPM will be of the form (PK0 ,SK0)
๏ A user who wishes to obtain services from an application software on a
machine generates a pseudonym of the form (PKi ,SKi )
๏ At the end of the protocol run the application software is provided a
guarantee on the identity of the user and the associated TPM, but the
system still protects the identity of both the TPM and the user
associated with it.
19. Advantages
๏ Compared to other pseudonym schemes, our scheme
has an efficient identification protocol.
๏ Computations may be performed on the module itself,
whereas the DAA scheme requires computation to be
distributed among the TPM and the host computer.
๏ there are no new secret key to be generated for each
pseudonyms, only counter values of the pseudonym
๏ no appreciable increase in storage requirement even
when the number of pseudonyms required are high
๏ ideally suited for storage constraint devices
20. What’s Missing? Future Work?
๏ Needs a strong composite modulus. (May be 4096 bits)
๏ Prime modulus method ruled out, as SDDH is trivial.
๏ Every generated pseudonym needs to fall with the same
group as the master secret key.
๏ Identity Transfer
๏ Pseudonym chains cannot be formed. (NOT YET!)
๏ That is, using PK1 to generate new pseudonyms, but still
verifiable using SK0.